Finite-time performance analysis of static simulated annealing algorithms

Computational Optimization and Applications

Volumn 21, Issue 1, 2002, Pages 21-53

  Orosz, Jeffrey E ^a   Jacobson, Sheldon H ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Cooling schedules; Finite time performance; Local search algorithms; Simulated annealing

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; RANDOM PROCESSES; SIMULATED ANNEALING; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

DISCRETE OPTIMIZATION; FINITE TIME PERFORMANCE; FIXED COOLING SCHEDULE; GENERALIZED HILL CLIMBING ALGORITHMS; LOCAL SEARCH ALGORITHMS; RUN LENGTH ANALYSIS; STATIC SIMULATED ANNEALING;

GLOBAL OPTIMIZATION;

EID: 0036178386     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013544329096     Document Type: Article

References (29)

1. Simulated annealing methods with general acceptance probabilities
2. A climbing autonomous robot for inspection applications in 3D complex environments
3. The exit path of a Markov chain with rare transitions
4. A limit-theorem for a class of inhomogeneous Markov-processes
5. Simulated annealing: Searching for an optimal temperature schedule
6. A method for solving traveling-salesman problems
7. Some results characterizing the finite time behaviour of the simulated annealing algorithm
8. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
9. Bounding the probability of success of stochastic methods for global optimization
10. Simulated annealing with an optimal fixed temperature
11. Simulated annealing: Past, present, and future
12. Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results
13. Simulated annealing for order spread minimization in sequencing cutting patterns
14. Cooling schedules for optimal annealing
15. An effective implementation of the Lin-Kernighan traveling salesman heuristic
16. The finite-time performance of generalized hill climbing algorithms
17. The theory and practice of simulated annealing
18. Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms
19. A class of convergent generalized hill climbing algorithms
20. On the convergence of generalized hill climbing algorithms
21. A VLSI scan-chain optimization algorithm for multiple scan-paths
22. An effective heuristic for the traveling salesman problem
23. Parallel simulated annealing
24. Convergence and finite-time behavior of simulated annealing
25. Efficient schedules for simulated annealing
26. A new simulated annealing algorithm
27. General simulated annealing