Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

A New Heuristic Algorithm for Traveling Salesman Problems

외판원문제에 대한 효율적인 새로운 경험적 방법 개발

  • 백시현 (아주대학교 산업공학과 대학원) ;
  • 김내헌 (아주대학교 산업공학과)
  • Published : 1999.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

The TSP(Traveling Salesman Problem) is one of the most widely studied problems in combinatorial optimization. The most common interpretation of TSP is finding a shortest Hamiltonian tour of all cities. The objective of this paper proposes a new heuristic algorithm MCH(Multi-Convex hulls Heuristic). MCH is a algorithm for finding good approximate solutions to practical TSP. The MCH algorithm is using the characteristics of the optimal tour. The performance results of MCH algorithm are superior to others algorithms (NNH, CCA) in CPU time.

Keywords