Metaheuristics in combinatorial optimization
Top Cited Papers
- 1 September 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 35 (3), 268-308
- https://doi.org/10.1145/937503.937505
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 behavior 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.Keywords
This publication has 66 references indexed in Scilit:
- Local search with constraint propagation and conflict-based heuristicsArtificial Intelligence, 2002
- Ant Colony Optimization and Stochastic Gradient DescentArtificial Life, 2002
- Generic metaheuristics application to industrial engineering problemsComputers & Industrial Engineering, 1999
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Reactive search, a history-sensitive heuristic for MAX-SATACM Journal of Experimental Algorithmics, 1997
- A Measure of LandscapesEvolutionary Computation, 1996
- Landscapes and their correlation functionsJournal of Mathematical Chemistry, 1996
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- An introduction to simulated evolutionary optimizationIEEE Transactions on Neural Networks, 1994
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977