Searching for backbones - A high-performance parallel algorithm for solving combinatorial optimization problems

Future Generation Computer Systems

Volumn 19, Issue 1, 2003, Pages 121-131

  Schneider, Johannes ^a  

^a UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

Massive Parallelization; Optimization; Traveling Salesman problem

Indexed keywords

COMBINATORIAL MATHEMATICS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL PROBLEMS;

COMPUTATION THEORY;

EID: 0037211353     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(02)00106-1     Document Type: Conference Paper

References (28)

1. K. Binder, D.W. Heermann, Monte Carlo Simulation in Statistical Physics, second ed., Springer, Berlin, 1992.
2. Clarke G., Wright J.W., Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12:1964;568-581.
3. Dantzig G.B., Ramser J.H., The truck dispatching problem. Manage. Sci. 6:1959;80-91.
4. Ch. Darwin, On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life, J. Murray, London, 1859.
5. Dueck G., Scheuer T., Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90:1990;161-175.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
7. F. Glover, M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, 1997.
8. M. Grötschel, Polyedrische Kombinatorik und Schnittebenenverfahren, Preprint No. 38, University of Augsburg, Germany, 1984.
9. Grötschel M., Holland O., Solution of large-scale symmetric travelling salesman problems. Math. Prog. 51:1991;141-202.
10. J. Hromkovic, Algorithmics for Hard Problems, Springer, Berlin, 2001.
11. http://www.informatik.uni-heidelberg.de/groups/comopt/software/TSPLIB95.
12. http://www-apache.imag.fr/̃paugerat/VRP/INSTANCES.
13. Kirkpatrick S., Gelatt C.D. Jr., Vecchi M.P., Optimization by simulated annealing. Science. 220:1983;671-680.
14. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys, The Traveling Salesman Problem, Wiley, New York, 1985.
15. Lin S., Computer solutions of the Traveling Salesman Problem. Bell Syst. Tech. J. 44:1965;2245-2269.
16. Lin S., Kernighan B.W., An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21:1973;498-516.
17. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E., Equation of state calculations for fast computing machines. J. Chem. Phys. 21:1953;1087-1092.
18. Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L., Determining computational complexity from characteristic phase transitions. Nature. 400:1999;133-137.
19. Moscato P., Fontanari J.F., Stochastic vs. deterministic update in simulated annealing. Phys. Lett. A. 146:1990;204-208.
20. T.K. Ralphs, L. Kopman, W.R. Pulleyblank, L.E. Trotter Jr.z, On the Capacitated Vehicle Routing Problem, Math. Prog., in press; http://www.lehigh.edu/̃tkr2/cv/./research/papers/vrp.ps.
21. G. Reinelt, The Traveling Salesman, Lecture Notes in Computer Science, Vol. 840, Springer, Berlin, 1994.
22. Rosenkrantz D.J., Stearns R.E., Lewis P.M. II, An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6:1977;563-581.
23. J. Schneider, Effiziente parallelisierbare physikalische optimierungsverfahren, Ph.D. Thesis, University of Regensburg, Germany, 1999.
24. J. Schneider, Parallelisierung physikalischer optimierungsverfahren, Diploma Thesis, University of Regensburg, Germany, 1995.
25. Schneider J., Britze J., Ebersbach A., Morgenstern I., Puchta M., Optimization of production planning problems - a case study for assembly lines. Int. J. Mod. Phys. C. 11:2000;949-972.
26. Schneider J., Froschhammer Ch., Morgenstern I., Husslein Th., Singer J.M., Searching for backbones - an efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Commun. 96:1996;173-188.
27. E. Schöneburg, F. Heinzmann, S. Feddersen, Genetische Algorithmen und Evolutionsstrategien, Addison-Wesley, Bonn, Germany, 1994.
28. Stadler P.F., Schnabl W., The landscape of the traveling salesman problem. Phys. Lett. A. 161:1992;337-344.