An Efficient Algorithm based on Self-Organizing Feature Maps for Large Scale Traveling Salesman Problems

대규모 TSP과제를 효과적으로 해결할 수 있는 SOFM알고리듬

  • 김선종 (경북대학교 전자공학과) ;
  • 최흥문 (경북대학교 전자공학과)
  • Published : 1993.08.01

Abstract

This paper presents an efficient SOFM(self-organizing feature map) algorithm for the solution of the large scale TSPs(traveling salesman problems). Because no additional winner neuron for each city is created in the next competition, the proposed algorithm requires just only the N output neurons and 2N connections, which are fixed during the whole process, for N-city TSP, and it does not requires any extra algorithm of creation of deletion of the neurons. And due to direct exploitation of the output potential in adaptively controlling the neighborhood, the proposed algorithm can obtain higher convergence rate to the suboptimal solutions. Simulation results show about 30% faster convergence and better solution than the conventional algorithm for solving the 30-city TSP and even for the large scale of 1000-city TSPs.

Keywords