비대칭 외판원 문제에서 3-Opt를 이용한 효율적인 국지탐색 알고리듬

Abstract

The traveling salesman problem is a representative NP... Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time . Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected, It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verfied by numerous experiments.