組合せ最適化問題の解空間における上位構造に基づくメタヒューリスティクスの基礎検討

概要

論文の詳細を見る
Metaheuristics is a new paradigm that aims to obtain an approximate solution within a feasible computation time. To design the effective metaheuristics, strategies of intensification and diversification are essential. This paper proposes an algorithm that has long term policy for realizing intensification and diversification based on higher level structure in solution space. In order to verify the performance, the proposed algorithm is applied to some traveling salesman problems which are typical combinatorial optimization problems.