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. © 2002 Elsevier Science B.V. All rights reserved.
https://doi.org/10.1016/S0378-4371(02)01078-6Cite as:
@article{Schneider_2002,
doi = {10.1016/s0378-4371(02)01078-6},
url = {https://doi.org/10.1016%2Fs0378-4371%2802%2901078-6},
year = 2002,
month = {nov},
publisher = {Elsevier {BV}},
volume = {314},
number = {1-4},
pages = {151--155},
author = {Johannes Schneider},
title = {The time-dependent traveling salesman problem},
journal = {Physica A: Statistical Mechanics and its Applications}
}