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...

Full description

Saved in:

Bibliographic Details
Published in:	Computer physics communications Vol. 96; no. 2; pp. 173 - 188
Main Authors:	Schneider, Johannes, Froschhammer, Christine, Morgenstern, Ingo, Husslein, Thomas, Singer, Johannes Maria
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.08.1996 Elsevier Science
Subjects:	Applied sciences Backbone Computational techniques Computer science; control theory; systems Degeneracy Exact sciences and technology Markov processes Mathematical methods in physics Monte Carlo Monte carlo and statistical methods Optimization Other topics of general interest to physicists Parallel Physics Probability theory, stochastic processes, and statistics Theoretical computing Threshold accepting TSP Backbone 02.70.Lq 89.20.+a 89.80.+h Parallel Optimization 89.90.+n TSP 02.50.Ga Degeneracy Monte Carlo Threshold accepting 02.50.-r Travelling salesman problem Parallel processing Computerized simulation Algorithms
ISSN:	0010-4655, 1879-2944
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!