Analysis of static simulated annealing algorithms

DOI10.1023/A:1019633214895MaRDI QIDQ1810929zbMATH OpenOpenAlexFDO

Authors Jeffrey E. Orosz, Sheldon H. Jacobson

Publication date 9 June 2003

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

Full work available at URL https://doi.org/10.1023/a:1019633214895

zbMATH Keywords

simulated annealingfinite-time performancecooling schedulesLocal search algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Finite-time performance analysis of static simulated annealing algorithms
• Performance analysis of cyclical simulated annealing algorithms
• A convergence analysis of generalized hill climbing algorithms
• On the convergence of generalized hill climbing algorithms
• A class of convergent generalized hill climbing algorithms

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A class of convergent generalized hill climbing algorithms
• A convergence analysis of generalized hill climbing algorithms
• A limit theorem for a class of inhomogeneous Markov processes
• A note on the finite time behavior of simulated annealing.
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Analysis of static simulated annealing algorithms
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing
• Finite-time performance analysis of static simulated annealing algorithms
• Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
• On the convergence of generalized hill climbing algorithms
• Parallel simulated annealing
• Simulated Annealing: Searching for an Optimal Temperature Schedule
• Simulated annealing with an optimal fixed temperature
• Some results characterizing the finite time behaviour of the simulated annealing algorithm.
• The exit path of a Markov chain with rare transitions

Cited in

(12)

• Analysis of static simulated annealing algorithms
• Revisiting simulated annealing: a component-based analysis
• Towards the analysis of the simulated annealing method in the multiextremal case
• On the convergence of generalized hill climbing algorithms
• Performance analysis of cyclical simulated annealing algorithms
• Finite-time performance analysis of static simulated annealing algorithms
• Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• A statistical analysis of simulated annealing applied to the p-median problem
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• A landscape-based analysis of fixed temperature and simulated annealing
• An efficient meta-heuristic algorithm for grid computing

This page was built for publication: Analysis of static simulated annealing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810929)