Simulated annealing algorithm: Technical improvements

RAIRO Recherche Operationnelle

Volumn 32, Issue 1, 1998, Pages 43-73

  Delamarre, D ^b   Virot, B ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

^b NONE

Author keywords

Cost Function Distortion; Cubic Graph; Hamiltonian Path; Heuristics; Optimization; Parallelization; Simulated Annealing; Temperature Schedule

Indexed keywords

EID: 0002301331     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1998320100431     Document Type: Article

References (33)

1. E. H. L. AARTS, M. J. de BONT, E. H. A. HABERS and P. J. M. van LAARHOVEN, Parallel implementation of the statistical cooling algorithm, The VLSI Journal, June 1986, 4, pp. 209-238.
2. E. H. L. AARTS and P. J. M. van LAARHOVEN, Simulated Annealing and Applications: Mathematics and its Applications, D. Reidel Publishing Company, 1987.
3. J. AKAYAMA, G. EXOO and F. HARARY, Covering and packing in graph III: cyclic and acyclic invariant, Math. Slovaca, 1980, 30, pp. 405-417.
4. E. H. L. AARTS and J. KORST, Simulated Annealing and Boltzmann Machines, John Wiley & Sons Ltd., 1989.
5. R. AZENCOTT, Sequential Annealing: Acceleration by Monotone Concave Distortions of the Energy Function, section 1.5, pp. 6-7, In AZENCOTT [6], 1992.
6. R. AZENCOTT, editor, Simulated Annealing: Parallelization Techniques, John Wiley & Sons inc., 1992.
7. O. CATONI, Etude Asymptotique des Algorithmes de Recuit Simulé, PhD thesis, Université d'Orsay, 1990.
8. O. CATONI, Rates of Convergence for Sequential Annealing: a Large Deviation Approach, chapter 3, pp. 25-36, In Azencott [6], 1992.
9. T. S. CHIANG and Y. CHOW, On the convergence rates of annealing processes, SIAM J. Control Optimization, 1988, 26, pp. 1455-1470.
10. D. DELAMARRE, J. L. FOUQUET, H. THUILLIER and B. VIROT, Linear-k-arboricity of cubic graphs. Research Report 93-8, Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans BP 6759 F45067 Orléans Cedex 2, 1993.
11. D. DELAMARRE, Etude et Conception d'Algorithmes Parallèles d'Optimisation Combinatoire Discrète Approchée. Implantation sur Architectures MIMD, PhD thesis, Université dOrléans, LIFO, 4, rue Léonard de Vinci, BP 6759 F45067 Orléans Cedex 2, France, Dec. 1994.
12. D. DELAMARRE and B. VIROT, Simulated Annealing Applied to the Hamiltonian Problem for Cubic Graphs, Research Report 93-3, Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans, BP 6759 F45067 Orléans Cedex 2, France, 1993.
13. R. DIEKMANN, R. LULLING and J. SIMON, A general purpose distributed implementation of simulated annealing. In IMACS'91 13th World Congress on Computation and Applied Mathematics, 1991, pp. 816-817.
14. M. D. DURAND, Trading Accuracy for Speed in Parallel Simulated Annealing Algorithms, PhD thesis, Columbia University, 1990.
15. M. D. DURAND and S. R. WHITE, Permissible error in parallel simulated annealing, Technical report, Institut de Recherche en Informatique et Systèmes aléatoires, Rennes, France, July 1991.
16. R. W. EGLESE, Simulated annealing: a tool for operational research, European Journal of Operational Research, 1990, 46, pp. 271-281.
17. M. I. FRIEDLIN and A. D. WENTZEL, Random Perturbations of Dynamical Systems, Springer-Verlag, 1984.
18. M. R. GAREY and M. R. JOHNSON, Computer and Intractability, Freeman, 1979.
19. G. GRAFFIGNE, Parallel Annealing by Periodically Interacting Multiple Searches: an Experimental Study, chapter 5, pp. 47-79, In AZENCOTT [6], 1992.
20. D. R. GREENING, Parallel simulated annealing techniques, Physica, 1990, D, 42, pp. 293-306.
21. D. R. GREENING, Simulated annealing with inacurrate costs functions, unpublished, October 1993.
22. B. HAJEK, Cooling schedules for optimal annealing, MOR, 1988, 13, pp. 311-329.
23. B. HAJEK and G. H. SASAKI, The time complexity of maximum matching by simulated annealing, J. of the ACM, 1988, 35, pp. 387-403.
24. L. INGBER, Very fast simulated reannealing, Journal of Mathematical Computing Modelling, 1989, 12 (8), pp. 967-973.
25. L. INGBER, Simulated annealing: Practice versus theory, Journal of Mathematical Computing Modelling, May 1993, 18 (11), pp. 23-57
26. K. KIMURA and K. TAKI, Time-homogeneous parallel annealing algorithm. In IMACS' 91 13th World Congress on Computation and Applied Mathematics, 1991, pp. 827-828.
27. S. KIRKPATRICK, C. D. GELATT Jr and M. P. VECCHI, Optimization by simulated annealing, Science, May 1983, 220(4598), pp. 671-680.
28. R. H. J. M. OTTEN, L. P. P. P. van GINNEKEN, The Annealing Algorithm, Kluwer Academic Publisher, 1989.
29. C. R. REEVES, Modern Heuristic Techniques for Combinatorial Problems, Colin R. Reeves, blackwell scientific publications editions, 1993, Osney Mead, Oxford OX2 0EL.
30. P. ROUSSEL-RAGOT and G. DREYFUS, Parallel Anealing by Multiple Trials: an Experimental study on a Transputer Network, chapter 7, pp. 91-108, In AZENCOTT [6], 1992.
31. B. VIROT, Parallel Annealing by Multiple Trials: Experimental study of a Chip Placement Problem Using a Sequent Machine, chapter 8, pp. 109-129, In Azencott [6], 1992.
32. E. E. WHITE, R. D. CHAMBERLAIN and M. A. FRANKLIN, Parallel simulated annealing using speculative computation, IEEE Transactions on Parallel and Distributed Systems, October 1991, 2(4).
33. S. R. WHITE, Concepts of scale in simulated annealing, In IEEE International Conference on Computer Design, 1984, pp. 646-651.