제어로봇시스템학회:학술대회논문집
- 1991.10a
- /
- Pages.601-605
- /
- 1991
A domain-partition algorithm for the large-scale TSP
Large-scale TSP의 근사해법에 관한 연구
Abstract
In this paper an approximate solution method for the large-scale Traveling Salesman Problem(TSP) is presented. The method start with the subdivision of the problem domain into a number of clusters by considering their geometries. The clusters have limited number of nodes so as to get local solutions. They are linked to give the least path which covers the whole domain and become TSPs with start- and end-node. The approximate local solutions in each cluster are obtained by using geometrical property of the cluster, and combined to give an overall-approximate solution for the large-scale TSP.
Keywords