Restarting search algorithms with applications to simulated annealing

DOI10.1239/AAP/999187906zbMath0989.60083OpenAlexW2090990578MaRDI QIDQ2726727

No author found.

Publication date: 22 July 2002

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0a7fbed1a350db63ff92fa9cce1c651d550d6031

zbMATH Keywords

simulated annealingcooling schedulesearch algorithmrestarting

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Signal detection and filtering (aspects of stochastic processes) (60G35) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (2)

Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem ⋮ Geometric Convergence of Genetic Algorithms Under Tempered Random Restart

This page was built for publication: Restarting search algorithms with applications to simulated annealing