The complexity of designing and implementing metaheuristics
MetadataShow full item record
Optimization problems can be found in several real application domains such as engineering, medicine, mathematics, mechanics, physics, mining, games, design, and biology, among others. There exist several techniques to the efficient solving of these problems, which can be organized in two groups: exact and approximate methods. Metaheuristics are one of the most famous and widely used approximate methods for solving optimization problems. Most of them are known for being inspired on interesting behaviors that can be found on the nature, such as the way in which ants, bees and fishes found food, or the way in which fireflies and bats move on the environment. However, solving optimization problems via metaheuristics is not always a simple trip. In this paper, we analyze and discuss from an usability standpoint how the effort needed to design and implement efficient and robust metaheuristics can be conveniently managed and reduced. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
Conference PaperSoto R.; Crawford B.; Vega E.; Paredes F. (Springer Verlag, 2015)
Using autonomous search for solving constraint satisfaction problems via new modern approaches (2020) Soto R.; Crawford B.; Olivares R.; Galleguillos C.; Castro C.; Johnson F.; Paredes F.; Norero E. (Elsevier B.V., 2016)
Conference PaperSoto R.; Crawford B.; Almonacid B.; Niklander S.; Olguín E. (Springer Verlag, 2016)