Umeå universitets logga

umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Martin-Luther-University Halle-Wittenberg, Germany and GISA GmbH, D-06112 Halle (Saale), Germany.
Martin-Luther-University Halle-Wittenberg, Germany.
Martin-Luther-University Halle-Wittenberg, Germany and Christian-Albrechts-University Kiel, Germany.
Martin-Luther-University Halle-Wittenberg, Germany.
Visa övriga samt affilieringar
2010 (Engelska)Ingår i: Proceedings of 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010) / [ed] B. Chen, Berlin-Heidelberg: Springer , 2010, Vol. 6124, s. 119-130Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesman Problem (TSP). The basic idea of the approach consists of iteratively transforming the TSP instance to another one with smaller size by contracting pseudo backbone edges. The iteration is stopped, if the new TSP instance is small enough for directly applying an exact algorithm or an efficient TSP heuristic. The pseudo backbone edges of each iteration are computed by a window based technique in which the TSP instance is tiled in non-disjoint sub-instances. For each of these sub-instances a good tour is computed, independently of the other sub-instances. An edge which is contained in the computed tour of every sub-instance (of the current iteration) containing this edge is denoted to be a pseudo backbone edge. Paths of pseudo-backbone edges are contracted to single edges which are fixed during the subsequent process.

Ort, förlag, år, upplaga, sidor
Berlin-Heidelberg: Springer , 2010. Vol. 6124, s. 119-130
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 (Print) 1611-3349 (Online) ; Volume 6124
Nationell ämneskategori
Diskret matematik
Identifikatorer
URN: urn:nbn:se:umu:diva-84452DOI: 10.1007/978-3-642-14355-7_13ISBN: 978-3-642-14354-0 Print (tryckt)ISBN: 978-3-642-14355-7 Online (tryckt)OAI: oai:DiVA.org:umu-84452DiVA, id: diva2:684191
Konferens
6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010)
Tillgänglig från: 2014-01-07 Skapad: 2014-01-07 Senast uppdaterad: 2018-06-08

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Person

Jäger, Gerold

Sök vidare i DiVA

Av författaren/redaktören
Jäger, Gerold
Diskret matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 272 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf