Finite-time performance analysis of static simulated annealing algorithms

DOI10.1023/A:1013544329096zbMath0988.90053OpenAlexW1578968677MaRDI QIDQ5960290

Jeffrey E. Orosz, Jacobson, Sheldon H.

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 annealingcooling schedulesfinite-time performancegeneralized hill climbing algorithmlocal search algorithms

Mathematics Subject Classification ID

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

Related Items (7)

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

Uses Software

• LKH

This page was built for publication: Finite-time performance analysis of static simulated annealing algorithms