Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
2009 (English)In: Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009) / [ed] A. Goldberg and Y. Zhou, Berlin-Heidelberg: Springer , 2009, 175-187 p.Conference paper (Refereed)
We introduce a reduction technique for the well-known TSP. The basic idea of the approach consists of transforming a TSP instance to another one with smaller size by contracting pseudo backbone edges computed in a preprocessing step, where pseudo backbone edges are edges which are likely to be in an optimal tour. A tour of the small instance can be re-transformed to a tour of the original instance. We experimentally investigated TSP benchmark instances by our reduction technique combined with the currently leading TSP heuristic of Helsgaun. The results strongly demonstrate the effectivity of this reduction technique: for the six VLSI instances xvb13584, pjh17845, fnc19402, ido21215, boa28924, and fht47608 we could set world records, i.e., find better tours than the effective reduction of the problem size so that we can search the more important tour subspace more intensively.
Place, publisher, year, edition, pages
Berlin-Heidelberg: Springer , 2009. 175-187 p.
, Lecture Notes in Computer Science, Volume 5564
IdentifiersURN: urn:nbn:se:umu:diva-84446OAI: oai:DiVA.org:umu-84446DiVA: diva2:684103
Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009)