Schneider, Johannes and Froschhammer, Christine and Morgenstern, Ingo and Husslein, Thomas and Singer, Johannes Maria (1996) Searching for backbones - An efficient parallel algorithm for the traveling salesman problem. COMPUTER PHYSICS COMMUNICATIONS, 96 (2-3). pp. 173-188. ISSN 0010-4655, 1879-2944
Full text not available from this repository.Abstract
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | OPTIMIZATION; optimization; parallel; Monte Carlo; threshold accepting; TSP; backbone; degeneracy |
| Subjects: | 000 Computer science, information & general works > 004 Computer science 500 Science > 530 Physics |
| Divisions: | Physics > Institute of Theroretical Physics > Professor Morgenstern > Group Ingo Morgenstern |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 29 Jun 2023 08:47 |
| Last Modified: | 29 Jun 2023 08:47 |
| URI: | https://pred.uni-regensburg.de/id/eprint/51560 |
Actions (login required)
 |
View Item |
