Search-space smoothing for combinatorial optimization problems

Physica A: Statistical Mechanics and its Applications

Volumn 243, Issue 1-2, 1997, Pages 77-112

  Schneider, Johannes ^a   Dankesreiter, Markus ^a   Fettes, Werner ^a   Morgenstern, Ingo ^a   Schmid, Martin ^a   Singer, Johannes Maria ^b  

^a UNIVERSITY OF REGENSBURG   (Germany)

^b UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

Great deluge; Local search; Monte carlo; Optimization; Smoothing; Traveling salesman

Indexed keywords

GRAPH THEORY; MONTE CARLO METHODS; PROBLEM SOLVING; STATE SPACE METHODS;

COMBINATORIAL OPTIMIZATION PROBLEMS; SEARCH SPACE SMOOTHING; TRAVELING SALESMAN PROBLEM;

OPTIMIZATION;

EID: 0031234634     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4371(97)00207-0     Document Type: Article

References (16)

1. J. Schneider, Parallelisierung physikalischer Optimierungsverfahren, Diploma Thesis, 1995.
2. M. Dankesreiter, Anwendung physikalischer Methoden auf Probleme der Logistik, Diploma Thesis, 1996.
3. J. Schneider, Ch. Froschhammer, I. Morgenstern, Th. Husslein, J.M Singer, Searching for backbones - an efficient parallel algorithm for the traveling salesman problem, Comput. Phys. Commun. 96(2/3) (1996) 173-188.
4. S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
5. G. Dueck, T. Scheuer, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90 (1990) 161-175.
6. J.C. Schön, M. Jansen, Angew. Chemie 108 (1996) 1358-1377.
7. Jun Gu, Efficient local search space smoothing: a case study of the traveling salesman problem (TSP), IEEE Trans. Systems Man Cybernet. 24 (5) (1994).
8. M. Grötschel, O. Holland, Solution of large-scale symmetric travelling salesman problems, Math. Programming 51 (1991) 141-202.
9. M.W. Padberg, G. Rinaldi, Optimization of a 532-city symmetric travelling salesman problem by branch and cut, Oper. Res. Lett. 6 (1987) 1-7.
10. G. Reinelt, TSPLIB - Version 1.2, Report No. 330, University of Augsburg, Germany, 1991.
11. P.F. Stadler, W. Schnabl, The landscape of the traveling salesman problem, preprint 91-047, Preprintreihe Sonderforschungsbereich 343 Diskrete Strukturen in der Mathematik at the University of Bielefeld, Germany, 1991.
12. S. Kirkpatrick, G. Toulouse, Configuration space analysis of the travelling salesman problem, J. Physique 46 (1985) 12770-1292.
13. K. Binder, D.W. Heermann, Monte Carlo Simulation in Statistical Physics, Springer, Berlin, 1992.
14. G. Dueck, New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel, J. Comput, Phys. 104 (1993) 86-92.
15. I. Morgenstern, D. Würtz, Z. Phys. B: Condens Matter 67 (1987) 397.
16. R. Tafelmayer, K.H. Hoffmann, Adaptive Schedules for Ensemble Based Threshold Accepting, TU Chemnitz-Zwickau, 1994.