Searching for backbones — an efficient parallel algorithm for the traveling salesman problem

The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer physics communications Ročník 96; číslo 2; s. 173 - 188
Hlavní autoři: Schneider, Johannes, Froschhammer, Christine, Morgenstern, Ingo, Husslein, Thomas, Singer, Johannes Maria
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.08.1996
Elsevier Science
Témata:
ISSN:0010-4655, 1879-2944
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good solutions for this problem. In this paper we discuss an efficient parallel method to reduce the TSP to a smaller one by finding these backbones and eliminating them to get even better solutions in a very short time and a few observables of interest corresponding to this parallel approach.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0010-4655
1879-2944
DOI:10.1016/0010-4655(96)00062-8