umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
Computer Science Institute, University of Halle-Wittenberg, Germany.
Computer Science Institute, University of Halle-Wittenberg, Germany.
Computer Science Institute, University of Halle-Wittenberg, Germany.
Computer Science Institute, University of Halle-Wittenberg, Germany.
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, Published paper (Refereed)
Abstract [en]

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.
Series
Lecture Notes in Computer Science, Volume 5564
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-84446OAI: oai:DiVA.org:umu-84446DiVA: diva2:684103
Conference
Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009)
Available from: 2014-01-07 Created: 2014-01-07 Last updated: 2015-02-20

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Jäger, Gerold
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 30 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf