arXiv · cond-mat/0502241
Optimization by thermal cycling
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. Mobius, A. Neklioudov, A. Diaz-Sanchez, K. H. Hoffmann, A. Fachat, M. Schreiber. 2005-02-09. Optimization by thermal cycling. https://doi.org/10.1103/physrevlett.79.4297
Cite the original work for its findings. Save a collection to share your selection of sources.