Record Breaking Optimization Results Using the Ruin and Recreate Principle

Journal of Computational Physics

Volumn 159, Issue 2, 2000, Pages 139-171

  Schrimpf, Gerhard ^a   Schneider, Johannes ^b   Stamm Wilbrandt, Hermann ^a   Dueck, Gunter ^a  

^a IBM   (Germany)

^b UNIVERSITY OF REGENSBURG   (Germany)

Author keywords

Combinatorial optimization; Global optimization; Monte carlo, threshold accepting; Network optimization; Traveling Salesman Problem; Vehicle Routing Problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; VEHICLE ROUTING;

BREAKINGS; CLASSICAL OPTIMIZATION; GLOBAL OPTIMISATION; MONTE CARLO, THRESHOLD ACCEPTING; NETWORK OPTIMIZATION; OPTIMISATIONS; OPTIMIZATION PRINCIPLE; OPTIMIZATION PROBLEMS; THRESHOLD ACCEPTING; VEHICLE ROUTING PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 0007939495     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.1999.6413     Document Type: Article

References (24)

1. M. Grötschel and O. Holland, Solution of large-scale symmetric travelling salesman problems, Math. Prog. 51, 141 (1991).
2. G. Reinelt, TSPLIB95, University of Heidelberg, Germany, 1995.
3. G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90, 161 (1990).
4. G. Dueck, New optimization heuristics: The great deluge algorithm and the record-to-record travel, J. Comput. Phys. 104, 86 (1993).
5. G. Dueck, T. Scheuer, and H.-M. Wallmeier, Toleranzschwelle und Sintflut: Neue Ideen zur Optimierung, Spektrum Wissensch. 3, 42 (1993).
6. J. Schneider, Ch. Froschhammer, I. Morgenstern, Th. Husslein, and J. M. Singer, Searching for backbones - An efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Comm. 96, 173 (1996).
7. J. Schneider, M. Dankesreiter, W. Fettes, I. Morgenstern, M. Schmid, and J. M. Singer, Search space smoothing for combinatorial optimization problems, Phys. A 243, 77 (1997).
8. J. Schneider, I. Morgenstern, and J. M. Singer, Bouncing towards the optimum: Improving the results of Monte Carlo optimization algorithms, Phys. Rev. E 58, 5085 (1998).
9. 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, 1087 (1953).
10. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, Optimization by simulated annealing, Science 220, 671 (1983).
11. K. Binder and D. W. Heermann, Monte Carlo Simulation in Statistical Physics (Springer-Verlag, New York, 1992).
12. M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Oper. Res. 35, 254 (1987).
13. W. Schnabl, P. F. Stadler, C. Forst, and P. Schuster, Full characterization of a strange attractor: Chaotic dynamics in low-dimensional replicator systems, Phys. D 48, 65 (1991).
14. E. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization (Wiley, Chichester, 1997).
15. S. Lin, Computer solutions to the traveling salesman problem, Bell System Tech. J. 44, 2245 (1965).
16. S. Lin and B. W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21, 498 (1973).
17. E. Schöneburg, F. Heinzmann, and S. Feddersen, Genetische Algorithmen und Evolutionsstrategien (Addison-Wesley, Bonn, 1994).
18. G. Reinelt, The Traveling Salesman (Springer-Verlag, Heidelberg, 1994).
19. S. R. Thangiah, I. H. Osman, and T. Sun, Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows, working paper, UKC/OR94/4, 1994.
20. Y. Rochat and E. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, J. Heur. 1, 147 (1995).
21. M. Desrochers, J. Desrosiers, and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40, 342 (1992).
22. J.-Y. Potvin and S. Begio, A Genetic Approach to the Vehicle Routing Problem with Time Windows, Publication CRT-953, Centre de recherche sur les transports, Universite de Montreal, 1994.
23. G. Dueck and J. Wirsching, in Proceedings of the Fourth European Conference on Mathematics in Industry, edited by H. Wacker and W. Zulehner (Teubner and Kluwer Academic, Netherlands, 1991).
24. W.-C. Chiang and R. Russell, Simulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows, working paper, Department of Quantitative Methods, University of Tulsa, Tulsa, OK, 1993.