近接最適性原理の定量的評価に基づく組合せ最適化手法

概要

論文の詳細を見る
It is known that many actual optimization problems can be formulated as combinatorial optimization problems. Meta-heuristics, which is a category of approximation algorithm as an effective method in complex and large scale combinatorial optimization problems, attracts expectation in recent years. This study focuses on Proximate Optimality Principle (POP). POP is the principle that good solutions posses some similar structure and experientially known that it holds for many combinatorial optimization problems. In this study, POP is quantitatively evaluated from the view points of parts and distance, and can be applied to search of optimization method. The proposed combinatorial optimization method based on quantitatively evaluated POP has higher optimality and lower computational complexity than conventional neighborhood search methods.