Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison

2.5kCitations
Citations of this article
1.9kReaders
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Blum, C., & Roli, A. (2003, September). Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys. https://doi.org/10.1145/937503.937505

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free