Metaheuristics in combinatorial optimization

書誌事項

タイトル別名
  • Overview and conceptual comparison
公開日
2003-09
権利情報
  • https://www.acm.org/publications/policies/copyright_policy#Background
DOI
  • 10.1145/937503.937505
公開者
Association for Computing Machinery (ACM)

この論文をさがす

説明

<jats:p>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<jats:italic>I&D</jats:italic>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.</jats:p>

収録刊行物

  • ACM Computing Surveys

    ACM Computing Surveys 35 (3), 268-308, 2003-09

    Association for Computing Machinery (ACM)

被引用文献 (15)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ