Simulated annealing beats Metropolis in combinatorial optimization

DOI10.1007/11523468_48MaRDI QIDQ5716810zbMATH OpenOpenAlexFDO

Authors Ingo Wegener

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468, http://hdl.handle.net/2003/22129

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Simulated annealing versus Metropolis for a TSP instance
• Optimization by simulated annealing
• The effect of the density of states on the Metropolis algorithm
• scientific article; zbMATH DE number 4079162
• Simulated annealing with an optimal fixed temperature

Cited in

(32)

• Runtime analysis of a simple ant colony optimization algorithm
• The Metropolis algorithm for graph bisection
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
• Does comma selection help to cope with local optima?
• A landscape-based analysis of fixed temperature and simulated annealing
• The runtime of the compact genetic algorithm on jump functions
• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
• Playing mastermind with constant-size memory
• Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments
• Simulated annealing versus Metropolis for a TSP instance
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Runtime analysis for self-adaptive mutation rates
• Crossover can provably be useful in evolutionary computation
• Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
• The use of tail inequalities on the probable computational time of randomized search heuristics
• scientific article; zbMATH DE number 953296 (Why is no real title available?)
• Potential induced random teleportation on finite graphs
• Scheduling massively parallel multigrid for multilevel Monte Carlo methods
• First Steps Towards a Runtime Analysis of Neuroevolution
• Choosing the right algorithm with hints from complexity theory
• Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
• Runtime analysis for permutation-based evolutionary algorithms
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Runtime analysis of quality diversity algorithms
• A causal framework for stochastic local search optimization algorithms
• Time lower bounds for the Metropolis process and simulated annealing
• Performance of the Metropolis algorithm on a disordered tree: the Einstein relation
• The effect of the density of states on the Metropolis algorithm
• Simulated annealing algorithm for the robust spanning tree problem
• Ant colony optimization and the minimum spanning tree problem

This page was built for publication: Simulated annealing beats Metropolis in combinatorial optimization

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