DSpace Repository

Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison Metaheuristics in Combinatorial Optimization 269

Show simple item record

dc.contributor.author Blum Christian
dc.contributor.author Roli Andrea
dc.contributor.author Blum C
dc.date.accessioned 2018-01-22T14:43:19Z
dc.date.available 2018-01-22T14:43:19Z
dc.date.issued 2003
dc.identifier.uri http://hdl.handle.net/123456789/6451
dc.description.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.
dc.format application/pdf
dc.title Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison Metaheuristics in Combinatorial Optimization 269
dc.type journal-article
dc.source.volume 35
dc.source.issue 3
dc.source.journal ACM Computing Surveys


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account