Simulated Annealing versus Metropolis for a TSP instance

Information Processing Letters

Volumn 104, Issue 6, 2007, Pages 216-219

  Meer, Klaus ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

2 Opt heuristic for TSP; Analysis of algorithms; Metropolis algorithm; Simulated Annealing

Indexed keywords

DECISION TREES; HEURISTIC ALGORITHMS; PROBLEM SOLVING; SIMULATED ANNEALING; TRAVELING SALESMAN PROBLEM;

ANALYSIS OF ALGORITHMS; METROPOLIS ALGORITHMS; MINIMUM SPANNING TREES; WEGENER'S TECHNIQUE;

COMBINATORIAL OPTIMIZATION;

EID: 34548387424     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.06.016     Document Type: Article

References (4)

1. Jerrum M., and Sinclair A. The Markov chain Monte Carlo method. An approach to approximate counting and integration. In: Hochbaum D. (Ed). Approximation Algorithms for NP-Hard Problems (1996), PWS Publishing 482-522
2. Johnson D.S., and McGeoch L.A. The traveling salesman problem: A case study. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (2003), Princeton University Press 215-310
3. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge Univ. Press
4. Wegener I. Simulated Annealing beats Metropolis in combinatorial optimization. In: Caires L., Italiano G.F., Monteiro L., Palamidessi C., and Yung M. (Eds). Proc. ICALP 2005. LNCS vol. 3580 (2005) 589-601