Simulated annealing versus Metropolis for a TSP instance

DOI10.1016/J.IPL.2007.06.016MaRDI QIDQ2380026zbMATH OpenOpenAlexFDO

Authors Klaus Meer

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.06.016

zbMATH Keywords

2-opt heuristic for TSPanalysis of algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 4085427
• Optimization by simulated annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Simulated annealing with an optimal fixed temperature

Cites work

• Automata, Languages and Programming
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)

Cited in

(9)

• An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering
• A landscape-based analysis of fixed temperature and simulated annealing
• Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling
• Potential induced random teleportation on finite graphs
• Automata, Languages and Programming
• Choosing the right algorithm with hints from complexity theory
• A causal framework for stochastic local search optimization algorithms
• Time lower bounds for the Metropolis process and simulated annealing
• The effect of the density of states on the Metropolis algorithm

This page was built for publication: Simulated annealing versus Metropolis for a TSP instance

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