A new simulated annealing algorithm

DOI10.1080/00207169508804397zbMath0852.68040OpenAlexW2081822979WikidataQ126245634 ScholiaQ126245634MaRDI QIDQ4876349

Xin Yao

Publication date: 1 May 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804397

zbMATH Keywords

simulated annealingstochastic search algorithmSA algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ A multi-stage IP-based heuristic for class timetabling and trainer rostering ⋮ Nature Inspired Meta-heuristics for Grid Scheduling: Single and Multi-objective Optimization Approaches ⋮ Recent advances in evolutionary computation ⋮ Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems ⋮ Performance analysis of cyclical simulated annealing algorithms

Cites Work

• Optimization by Simulated Annealing
• Very fast simulated re-annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Simulated annealing with extended neighbourhood

This page was built for publication: A new simulated annealing algorithm