DMCA
Metaheuristics in combinatorial optimization: Overview and conceptual comparison (2003)
Cached
Download Links
| Venue: | ACM COMPUTING SURVEYS |
| Citations: | 313 - 17 self |
BibTeX
@ARTICLE{Blum03metaheuristicsin,
author = {Christian Blum and Andrea Roli},
title = {Metaheuristics in combinatorial optimization: Overview and conceptual comparison},
journal = {ACM COMPUTING SURVEYS},
year = {2003},
pages = {268--308}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the different components and concepts that are used in the different metaheuristics in order to analyze their similarities and differences. Two very important concepts in metaheuristics are intensification and diversification. These are the two forces that largely determine the behaviour of a metaheuristic. They are in some way contrary but also complementary to each other. We introduce a framework, that we call the I&D frame, in order to put different intensification and diversification components into relation with each other. Outlining the advantages and disadvantages of different metaheuristic approaches we conclude by pointing out the importance of hybridization of metaheuristics as well as the integration of metaheuristics and other methods for optimization.
Keyphrases
combinatorial optimization conceptual comparison combinatorial optimization problem different metaheuristics important metaheuristics conceptual point diversification component industrial world different component different intensification different metaheuristic approach important concept
