Searching for backbones - An efficient parallel algorithm for the traveling salesman problem

Computer Physics Communications

Volumn 96, Issue 2-3, 1996, Pages 173-188

  Schneider, Johannes ^a   Froschhammer, Christine ^a   Morgenstern, Ingo ^a   Husslein, Thomas ^a   Singer, Johannes Maria ^b  

^a UNIVERSITY OF REGENSBURG   (Germany)

^b UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

Backbone; Degeneracy; Monte carlo; Optimization; Parallel; Threshold accepting; TSP

Indexed keywords

MONTE CARLO METHODS; OPTIMIZATION; PROBLEM SOLVING;

BACKBONES; TRAVELING SALESMAN PROBLEM (TSP);

PARALLEL ALGORITHMS;

EID: 0030213442     PISSN: 00104655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0010-4655(96)00062-8     Document Type: Article

References (24)

1. G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90 (1990) 161.
2. G. Reinelt, TSPLIB - Version 1.2, Report No. 330, University of Augsburg, Germany (1991).
3. J. Schneider, diploma thesis, Parallelisierung Physikalischer Optimierungsverfahren (1995).
4. M. Grötschel and O. Holland, Solution of large-scale symmetric travelling salesman problems, Mathematical Programming 51 (1991) 141.
5. K.-T. Mak and A.J. Morton, A modified Lin-Kernighan traveling salesman heuristic, UIC CRIM Working Paper 91-01, University of Illinois, Chicago (1991).
6. R. Lüling, B. Monien, M. Räcke and S. Tschöke, Efficient Parallelization of a Branch & Bound Algorithm for the Symmetric Traveling Salesman Problem, Dept. of Mathematics and Computer Science, University of Paderborn, Germany (1991).
7. M.W. Padberg and G. Rinaldi, Optimization of a 532-city symmetric travelling salesman problem by branch and cut, Operations Research Letters 6 (1987) 1.
8. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, Equation of state calculation by fast computing machines, J. Chem. Phys. 21 (1953) 1087.
9. K. Binder and D.W. Heermann, Monte Carlo Simulation in Statistical Physics (Springer, Berlin, 1992).
10. S. Kirkpatrick, C.D. Gelatt Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671.
11. D. Mitra, F. Romeo and A. Sangiovanni-Vincentelli, Convergence and finite-time behavior of simulated annealing, in: Proc. 24th Conf. Decision and Control (1985) p. 761.
12. S.B. Gelfand and S.K. Mitter, Analysis of simulated annealing for optimization, in: Proc. 24th Conf. on Decision and Control (1985) p. 779.
13. I. Morgenstern and J. Schneider (1994), unpublished.
14. K.J. Nurmela, Constructing Combinatorial Designs by Local Search, Research Report A27, Helsinki University of Technology (1993).
15. G. Dueck, New optimization heuristics: the great Deluge algorithm and the record-to-record travel, J. Comput. Phys. 104 (1993) 86.
16. P.F. Stadler and W. Schnabl, The landscape of the traveling salesman problem, preprint 91-047, Preprintreihe Sonderforschungsbereich 343, Diskrete Strukturen in der Mathematik, University of Bielefeld, Germany (1991).
17. K.H. Hoffmann, D. Würtz, C. de Groot and M. Hanf, Concepts in Optimizing Simulated Annealing: an Adaptive Approach for Parallel and Vector Machines, IPS, ETH Zürich (1991).
18. R. Tafelmayer and K.H. Hoffmann, Scaling features in complex optimization problems, Comput. Phys. Commun. 86 (1995) 81.
19. R. Tafelmayer and K.H. Hoffmann, Adaptive Schedules for Ensemble Based Threshold Accepting, TU Chemnitz-Zwickau, Germany (1994).
20. E. Schöneburg, F. Heinzmann and S. Feddersen, Genetische Algorithmen und Evolutionsstrategien (Addison-Wesley, Reading, MA, 1994).
21. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Reading, MA, 1989).
22. H. Mühlenbein, Parallel genetic algorithms, population genetics and combinatorial optimization, in: Proc. Third International Conference on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann, San Mateo, CA, 1989) pp. 416ff.
23. H. Mühlenbein and M. Gorges, Evolution algorithms in combinatorial optimization, Parallel Computing 7 (1988).
24. J.C. Schön and M. Jansen, Determination of candidate structures for simple ionic compounds through cell optimization, Comp. Mat. Science 4 (1995) 43.