A theoretical study on the behavior of simulated annealing leading to a new cooling schedule

DOI10.1016/J.EJOR.2004.03.035MaRDI QIDQ1779535zbMATH OpenOpenAlexFDO

Authors E. Triki, Y. Collette, Patrick Siarry

Publication date 1 June 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2004.03.035

zbMATH Keywords

Simulated annealingTraveling salesman problemThermal equilibriumAdaptive cooling schedule

Mathematics Subject Classification ID

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

Recommendations

• A new simulated annealing algorithm
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• Computational Science and Its Applications – ICCSA 2004
• An analytically derived cooling schedule for simulated annealing
• Simulated Annealing – An Annotated Bibliography

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 1314991 (Why is no real title available?)
• scientific article; zbMATH DE number 1391176 (Why is no real title available?)
• Adaptation on Rugged Landscapes
• Algorithmics for hard problems.
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• Equation of state calculations by fast computing machines
• Facts, Conjectures, and Improvements for Simulated Annealing
• Optimization by simulated annealing

Cited in

(11)

• Comparison of metaheuristics for the \(k\)-labeled spanning forest problem
• Applications of critical temperature in minimizing functions of continuous variables with simulated annealing algorithm
• Local search and lower bounds for the patient admission scheduling problem
• Metaheuristics approach to the aircrew rostering problem
• Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes
• Meta-control of an interacting-particle algorithm for global optimization
• Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
• Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems
• The interacting-particle algorithm with dynamic heating and cooling
• Approximate solution of a resource-constrained scheduling problem
• Re-use of samples in stochastic annealing

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A theoretical study on the behavior of simulated annealing leading to a new cooling schedule

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