A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
From MaRDI portal
Publication:1779535
DOI10.1016/j.ejor.2004.03.035zbMath1066.90043OpenAlexW2036931828MaRDI QIDQ1779535
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (9)
Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ Meta-control of an interacting-particle algorithm for global optimization ⋮ Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems ⋮ Local search and lower bounds for the patient admission scheduling problem ⋮ Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes ⋮ Metaheuristics approach to the aircrew rostering problem ⋮ Approximate solution of a resource-constrained scheduling problem ⋮ The interacting-particle algorithm with dynamic heating and cooling ⋮ Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Algorithmics for hard problems.
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Adaptation on Rugged Landscapes
- Facts, Conjectures, and Improvements for Simulated Annealing
- Equation of State Calculations by Fast Computing Machines
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
