Finite-time performance analysis of static simulated annealing algorithms

DOI10.1023/A:1013544329096MaRDI QIDQ5960290zbMATH OpenOpenAlexFDO

Authors Jeffrey E. Orosz, Sheldon H. Jacobson

Publication date 15 April 2002

Published in Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

simulated annealinglocal search algorithmsfinite-time performancecooling schedulesgeneralized hill climbing algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Analysis of static simulated annealing algorithms
• Performance analysis of cyclical simulated annealing algorithms
• scientific article; zbMATH DE number 1183278
• A convergence analysis of generalized hill climbing algorithms
• Simulated annealing methods with general acceptance probabilities

Cited in

(9)

• Visiting near-optimal solutions using local search algorithms
• Analysis of static simulated annealing algorithms
• A framework for analyzing sub-optimal performance of local search algorithms
• Global optimization performance measures for generalized hill climbing algorithms
• Using Markov chains to analyze the effectiveness of local search algorithms
• A convergence analysis of generalized hill climbing algorithms
• Performance analysis of cyclical simulated annealing algorithms
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• Derivative-free optimization: a review of algorithms and comparison of software implementations

Describes a project that uses

Uses Software

• LKH

This page was built for publication: Finite-time performance 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 Q5960290)