A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.

DOI10.1007/BF01022991zbMath1084.90014OpenAlexW2145366458MaRDI QIDQ1963624

Emile H. L. Aarts, Jan H. M. Korst, Peter J. M. Van Laarhoven

Publication date: 2 February 2000

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01022991

zbMATH Keywords

simulated annealingperformance analysisCombinatorial optimizationtraveling salesman problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Applications of statistical mechanics to specific types of physical systems (82D99)

Related Items

Boltzmann machines for travelling salesman problems, Genetic algorithms for the traveling salesman problem, Metaheuristics: A bibliography, From simulated annealing to stochastic continuation: a new trend in combinatorial optimization, A note on the effect of neighborhood structure in simulated annealing, A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, Last-Mile Shared Delivery: A Discrete Sequential Packing Approach, A Bayesian Approach to Simulated Annealing, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, A two-stage simulated annealing procedure for block layout problems

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item