MPI-I-2003-1-007

Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem

Tamaki, Hisao

MPI-I-2003-1-007. March 2003, 22 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
A strategy of merging several traveling salesman tours
into a better tour, called ACC (Alternating Cycles Contribution)
is introduced. Two algorithms embodying this strategy for
geometric instances is
implemented and used to enhance Helsgaun's implementaton
of his variant of the Lin-Kernighan heuristic. Experiments
on the large instances in TSPLIB show that a significant
improvement of performance is obtained.
These algorithms were used in September 2002 to find a
new best tour for the largest instance pla85900
in TSPLIB.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	297 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2003-1-007

BibTeX
@TECHREPORT{Hisao2003, AUTHOR = {Tamaki, Hisao}, TITLE = {Alternating cycles contribution: a strategy of tour-merging for the traveling salesman problem}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-2003-1-007}, MONTH = {March}, YEAR = {2003}, ISSN = {0946-011X},}