Journal article
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS journal on computing, Vol.19(1), pp.80-90
2007
DOI: 10.1287/ijoc.1050.0145
Abstract
This paper describes a variant of simulated annealing incorporating a variable penalty method to solve the traveling-salesman problem with time windows (TSPTW). Augmenting temperature from traditional simulated annealing with the concept of pressure (analogous to the value of the penalty multiplier), compressed annealing relaxes the time-window constraints by integrating a penalty method within a stochastic search procedure. Computational results validate the value of a variable-penalty method versus a static-penalty approach. Compressed annealing compares favorably with benchmark results in the literature, obtaining best known results for numerous instances.
Details
- Title: Subtitle
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- Creators
- Jeffrey W. Ohlmann - University of IowaBarrett W. Thomas - University of Iowa
- Resource Type
- Journal article
- Publication Details
- INFORMS journal on computing, Vol.19(1), pp.80-90
- DOI
- 10.1287/ijoc.1050.0145
- ISSN
- 1091-9856
- eISSN
- 1526-5528
- Language
- English
- Date published
- 2007
- Academic Unit
- Bus Admin College; Business Analytics
- Record Identifier
- 9984380493102771
Metrics
1 Record Views