The time-dependent traveling salesman problem

Johannes Schneider

Physica A: Statistical Mechanics and its Applications, 2002, vol. 314, issue 1, 151-155

Abstract: A problem often considered in Operations Research and Computational Physics is the traveling salesman problem, in which a traveling salesperson has to find the shortest closed tour between a given set of cities touching each city exactly once. The distances between the single nodes are known to the traveling salesperson. An extension of this problem is the time-dependent traveling salesman problem, in which these distances vary in time. I will show how this more complex problem is treated with physical optimization algorithms like simulated annealing. I will present results for the problem of the 127 beergardens in the area of Augsburg, in which I define a traffic zone in which traffic jams occur in the afternoon.

Keywords: Traveling salesman problem; Traffic jam; Simulated annealing; Monte Carlo (search for similar items in EconPapers)
Date: 2002
References: View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437102010786
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:314:y:2002:i:1:p:151-155

DOI: 10.1016/S0378-4371(02)01078-6

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().