帰納的アルゴリズムに基づく巡回セールスマン問題の解法

概要

論文の詳細を見る
It has long been recognized that abstraction can be used to reduce a problem-solving search. Since combinatorial optimization problems have extraordinary large search spaces, it is meaning-full to apply abstraction those problems. But it has never been shown that abstraction is useful to solve them. Inductive Algorithms that is a new problem-solving paradigm based on abstraction efficiently solved the knapsack problem that is a typical example of the combinatorial optimization problem. This article provides experimental results of applying Inductive Algorithms to the traveling salesman problem (for short, TSP). In particular, it is shown that this algorithm is applicable to the large scale TSP, consisting of 532 cities.
社団法人人工知能学会の論文
1996-01-01