TSPに対する自己組織化マップに基づいた免疫アルゴリズムの開発

概要

論文の詳細を見る
Many methods such as mathematical programming and heuristic methods have been proposed for solving the Traveling Salesman Problem (TSP). However, the TSP still stands as a difficult problem. Genetic Algorithm (GA), known as one of the heuristic methods, recently obtained practical solutions for the TSP. The purpose of this study is (1) to examine the performance of a few types of GA and the self-organizing map method (SOM), and (2) to present a new method to solve the TSP based on performance results. It becomes clear that SOM is a better solution than any other method examined. This result is a clue to design a new solving method for the TSP. The proposed method adopts Immune Algorithm (IA), where a various types of antibodies are supplied by SOM. Numerical experiments verify that the proposed new method obtains the best solution on the examined methods.
旭川工業高等専門学校の論文
2004-03-20