Parallel tempering for the traveling salesman problem

Chiaming Wang, Jeffrey D. Hyman, Allon Percus, Russel Caflisch

Research output: Contribution to journalArticle

Abstract

We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a straightforward implementation of parallel tempering can outperform simulated annealing in several crucial respects. When parameters are chosen appropriately, both methods yield close approximation to the actual minimum distance for an instance with 200 nodes. However, parallel tempering yields more consistently accurate results when a series of independent simulations are performed. Our results suggest that parallel tempering might offer a simple but powerful alternative to simulated annealing for combinatorial optimization problems.

Original languageEnglish (US)
Pages (from-to)539-556
Number of pages18
JournalInternational Journal of Modern Physics C
Volume20
Issue number4
DOIs
StatePublished - Apr 2009

Fingerprint

traveling salesman problem
Parallel Tempering
Traveling salesman problem
tempering
Tempering
Travelling salesman problems
simulated annealing
Simulated annealing
Simulated Annealing
Combinatorial optimization
optimization
Combinatorial Optimization
Minimum Distance
Combinatorial Optimization Problem
Optimization Methods
Simulation
simulation
Benchmark
Series
Alternatives

Keywords

  • Combinatorial optimization
  • Parallel tempering
  • Simulated annealing
  • Traveling salesman problem

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Mathematical Physics
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Parallel tempering for the traveling salesman problem. / Wang, Chiaming; Hyman, Jeffrey D.; Percus, Allon; Caflisch, Russel.

In: International Journal of Modern Physics C, Vol. 20, No. 4, 04.2009, p. 539-556.

Research output: Contribution to journalArticle

Wang, Chiaming ; Hyman, Jeffrey D. ; Percus, Allon ; Caflisch, Russel. / Parallel tempering for the traveling salesman problem. In: International Journal of Modern Physics C. 2009 ; Vol. 20, No. 4. pp. 539-556.
@article{f3333067a83946239a56a29bf299810b,
title = "Parallel tempering for the traveling salesman problem",
abstract = "We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a straightforward implementation of parallel tempering can outperform simulated annealing in several crucial respects. When parameters are chosen appropriately, both methods yield close approximation to the actual minimum distance for an instance with 200 nodes. However, parallel tempering yields more consistently accurate results when a series of independent simulations are performed. Our results suggest that parallel tempering might offer a simple but powerful alternative to simulated annealing for combinatorial optimization problems.",
keywords = "Combinatorial optimization, Parallel tempering, Simulated annealing, Traveling salesman problem",
author = "Chiaming Wang and Hyman, {Jeffrey D.} and Allon Percus and Russel Caflisch",
year = "2009",
month = "4",
doi = "10.1142/S0129183109013893",
language = "English (US)",
volume = "20",
pages = "539--556",
journal = "International Journal of Modern Physics C",
issn = "0129-1831",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Parallel tempering for the traveling salesman problem

AU - Wang, Chiaming

AU - Hyman, Jeffrey D.

AU - Percus, Allon

AU - Caflisch, Russel

PY - 2009/4

Y1 - 2009/4

N2 - We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a straightforward implementation of parallel tempering can outperform simulated annealing in several crucial respects. When parameters are chosen appropriately, both methods yield close approximation to the actual minimum distance for an instance with 200 nodes. However, parallel tempering yields more consistently accurate results when a series of independent simulations are performed. Our results suggest that parallel tempering might offer a simple but powerful alternative to simulated annealing for combinatorial optimization problems.

AB - We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a straightforward implementation of parallel tempering can outperform simulated annealing in several crucial respects. When parameters are chosen appropriately, both methods yield close approximation to the actual minimum distance for an instance with 200 nodes. However, parallel tempering yields more consistently accurate results when a series of independent simulations are performed. Our results suggest that parallel tempering might offer a simple but powerful alternative to simulated annealing for combinatorial optimization problems.

KW - Combinatorial optimization

KW - Parallel tempering

KW - Simulated annealing

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=67649390954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649390954&partnerID=8YFLogxK

U2 - 10.1142/S0129183109013893

DO - 10.1142/S0129183109013893

M3 - Article

VL - 20

SP - 539

EP - 556

JO - International Journal of Modern Physics C

JF - International Journal of Modern Physics C

SN - 0129-1831

IS - 4

ER -