Optimization by thermal cycling
arXiv:cond-mat/0502241 · doi:10.1103/PhysRevLett.79.4297
Abstract
An optimization algorithm is presented which consists of cyclically heating and quenching by Metropolis and local search procedures, respectively. It works particularly well when it is applied to an archive of samples instead of to a single one. We demonstrate for the traveling salesman problem that this algorithm is far more efficient than usual simulated annealing; our implementation can compete concerning speed with recent, very fast genetic local search algorithms.
Basic reference to a proceedings contribution submitted today. Latex, 5 pages, 1 figure
Cited by in corpus (18)
- Structure and dynamics of molecular networks: A novel paradigm of drug discovery. A comprehensive review
- Optimization with Extremal Dynamics
- Extremal Optimization for Graph Partitioning
- Basin Hopping with Occasional Jumping
- Faster Monte Carlo Simulations at Low Temperatures. The Waiting Time Method
- Renormalization for Discrete Optimization
- The lid method for exhaustive exploration of metastable states of complex systems
- Combinatorial Optimization by Iterative Partial Transcription
- Numerical study of relaxation in electron glasses
- Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
- Non-ergodic effects in the Coulomb glass: specific heat
- Dielectric susceptibility of the Coulomb-glass
- Localization and conductance in the quantum Coulomb glass
- Plasticity-rigidity cycles: A general adaptation mechanism
- Specific heat of the Coulomb glass
- Optimization and benchmarking of the thermal cycling algorithm
- Optimization by Record Dynamics
- Gradient dynamics in reinforcement learning