Rescaled simulated annealing-accelerating convergence of simulated annealing by rescaling the states energies

Journal of Heuristics

Volumn 6, Issue 2, 2000, Pages 215-252

  Herault, L ^a  

^a CEA LETI   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; TRAVELING SALESMAN PROBLEM;

RESCALED SIMULATED ANNEALING (RSA);

SIMULATED ANNEALING;

EID: 0033738294     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009627527067     Document Type: Article

References (23)

1. Aarts and Laarhoven. (1987). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers.
2. Aarts and Korst. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: Wiley Publishers.
3. Anily and Federgruen. (1987). "Simulated Annealing Methods with General Acceptance Probabilities." Journal of Applied Probability 24, 657-667.
4. Azencott. (1992). Simulated Annealing: Parallelization Techniques. New York: Wiley Publishers.
5. Bilbro et al. (1990). "Extraction of the Parameters of Equivalent Circuits of Microwave Transistors Using Tree Annealing." I.E.E.E. Transactions on Microwave Theory and Techniques, November.
6. Bilbro and Snyder. (1991). "Optimization of Functions with Many Local Minima." I.E.E.E. Transactions on Systems, Man and Cybernetics 21(4).
7. Cerny. (1985). "A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulated Algorithm." Journal of Optimization Theory and Applications 45, 41-51.
8. Dowsland. (1995). "Simulated Annealing." In C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Optimization Problems. McGraw Hill Publishers, pp. 20-69.
9. Feller. (1950). An Introduction to Probability Theory and its Applications. New York: Wiley Publishers.
10. Fleisher. (1995). "Cybernetic Optimization by Simulated Annealing: Accelerating Convergence by Parallel Processing and Probabilistic Feedback Control." Journal of Heuristics 1(2), 225-246.
11. Hajek. (1988). "Cooling Schedules for Optimal Annealing." Mathematics of Operations Research 13(2), 311-329.
12. Hastings. (1970). "Monte Carlo Sampling Methods Using Markov Chains and Their Applications." Biometrika 57(1), 97-109.
13. Isaacson and Madsen. (1976). Markov Chains: Theory and Applications. John Wiley Publishers.
14. Kirkpatrick, Gelatt, and Vecchi. (1983). "Optimization by Simulated Annealing." Science 220, 671-680.
15. Kozniewska (1962). "Ergodicité et stationnarité des chaînes de Markov variables à un nombre fini d'états possibles." Colloq. Math. 9, 333-346.
16. van Laarhoven and Aarts. (1989). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers.
17. Lundy and Mees. (1986). "Convergence of an Annealing Algorithm." Mathematical Programming 34, 111-124.
18. Metropolis et al. (1953). "Equation of State Calculations by Fast Computing Machines." Journal of Chemical Physics 21, 1087-1092.
19. Mitra, Romeo, and Sangiovanni-Vincentelli. (1986). "Convergence and Finite-Time Behavior of Simulated Annealing." Adv. Appl. Prob. 18, 747-771.
20. Reinelt. (1994). The Traveling Salesman - Computational Solutions for TSP Applications. Springer Verlag Publishers.
21. Seneta. (1981). Non-Negative Matrices and Markov Chains. New York: Springer Verlag Publishers.
22. Snyder et al. (1990). "Optimal Thresholding - A New Approach." Pattern Recognition Letters 11(12), 803-810.
23. Verhoeven and Aarts. (1995). "Parallel Local Search." Journal of Heuristics 1(1), 43-65.