Analysis of static simulated annealing algorithms

DOI10.1023/A:1019633214895zbMath1047.90078MaRDI QIDQ1810929

Jacobson, Sheldon H., Jeffrey E. Orosz

Publication date: 9 June 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

simulated annealing; cooling schedules; finite-time performance; Local search algorithms

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

Related Items

An efficient meta-heuristic algorithm for grid computing, Analysis of static simulated annealing algorithms, From simulated annealing to stochastic continuation: a new trend in combinatorial optimization, Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization

Cites Work

• Unnamed Item
• A limit theorem for a class of inhomogeneous Markov processes
• On the convergence of generalized hill climbing algorithms
• Analysis of static simulated annealing algorithms
• A class of convergent generalized hill climbing algorithms
• Simulated Annealing With An Optimal Fixed Temperature
• A Note on the Finite Time Behavior of Simulated Annealing
• The exit path of a Markov chain with rare transitions
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing
• Parallel simulated annealing
• Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
• A convergence analysis of generalized hill climbing algorithms
• Simulated Annealing: Searching for an Optimal Temperature Schedule
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Some results characterizing the finite time behaviour of the simulated annealing algorithm.
• Finite-time performance analysis of static simulated annealing algorithms