Journal of the Korean Society for Precision Engineering (한국정밀공학회지)
- Volume 9 Issue 3
- /
- Pages.122-131
- /
- 1992
- /
- 1225-9071(pISSN)
- /
- 2287-8769(eISSN)
A Domain-Partition Algorithm for the Large-Scale TSP
Large-Scale TSP 근사해법에 관한 연구
- Yoo, Hyeong-Seon (Dept.of Operation Engineering, Inha University) ;
- Kim, Hyun-Sng (Dept.of Operation Engineering, Inha University)
- Published : 1992.09.01
Abstract
In this paper an approximate solution method for the large-scale Traveling Salesman Problem (TSP) is presented. The method starts with the subdivision of the problem domain into a number of cluster by considering their geometric characteristic. Each cluster has a limited number of nodes so as to get a local solution. They are linked go give the least pathe which covers the whole domain and become TSPs solution with start-and end-node. The approximate local solution in each cluster are obtained based on geometrical properties of the cluster, and combined to give an overall approximate solution for the larte-scale TSP.
Keywords