Solving TSP by dismantling cross paths

Yongsheng Pan, Yong Xia

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Traveling salesman Problem (TSP) is a classical NP-hard problem and has been extensively studied in literature. Eliminating the cross paths, which commonly exist in approximate solutions to large scale TSP, can effectively improve the quality of the solutions. Through studying the impact of cross paths on the cost of a loop, in this paper we develop a method to detect and dismantle cross paths, and thus propose a novel greedy algorithm-based approach to the TSP. This approach has been evaluated on ten TSP data sets and compared to three classical optimization techniques, including the elastic network, ant colony algorithm and genetic algorithm. Our results show that the proposed approach can get approximate solution of high quality with far less computational cost and has an excellent performance in solving large-scale TSP.

Original languageEnglish
Title of host publicationIEEE International Conference on Orange Technologies, ICOT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages121-124
Number of pages4
ISBN (Electronic)9781479962846
DOIs
StatePublished - 12 Nov 2014
Event2014 IEEE International Conference on Orange Technologies, ICOT 2014 - Xi'an, China
Duration: 20 Sep 201423 Sep 2014

Publication series

NameIEEE International Conference on Orange Technologies, ICOT 2014

Conference

Conference2014 IEEE International Conference on Orange Technologies, ICOT 2014
Country/TerritoryChina
CityXi'an
Period20/09/1423/09/14

Keywords

  • cross paths
  • greedy algorithm
  • optimization
  • Traveling salesman problem

Fingerprint

Dive into the research topics of 'Solving TSP by dismantling cross paths'. Together they form a unique fingerprint.

Cite this