Abstract
In the standard version of the traveling salesman problem (TSP), we are given a set of customers located in and around a city and the distances between each pair of customers, and need to find the shortest tour that visits each customer exactly once. Suppose that some of the customers are located in the center of the city. Within a window of time, center city becomes congested so that the time to travel between customers takes longer. Clearly, we would like to construct a tour that avoids visiting customers when the center of the city is congested. This variant of the TSP is known as the time dependent TSP (TDTSP). We review the literature on the TDTSP, develop two solution algorithms, and report computational experience with our algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D., Bixby, R., Chvatal, V., and Cook, W., 1999, Finding tours in the TSP, Forschungsinstitut fur Diskrete Mathematik, Report No. 99885, Universitat Bonn; http://www.tsp.gatech.edu/papers/index.html.
Applegate, D., Bixby, R., Chvatal, V., and Cook, W., 2004, Solving traveling salesman problems; http://www.math.princeton.edu/tsp/index.html.
Bentner, J., Bauer, G., Obermair, G., Morgenstern, I., and Schneider, J., 2001, Optimization of the time-dependent traveling salesman problem with Monte Carlo methods, Physical Review E. 64:036701.
Christofides, N., Mingozzi, A., and Toth, P., 1979, The vehicle routing problem, in: Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, eds., John Wiley & Sons, Chichester, UK, pp. 315–338.
Golden, B., Magnanti, T., and Nguyen, H., 1977, Implementing vehicle routing algorithms, Networks 7:1132–148.
Johnson, D., and McGeoch, L., 1997, The traveling salesman problem: A case study in local optimization, in: Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, eds., Wiley, London, pp. 215–310.
Junger, M., Reinelt, G., and Rinaldi, G., 1995, The traveling salesman problem, in: Network Models, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, eds., North-Holland, The Netherlands, pp. 225–330.
Li, F., Golden, B., and Wasil, E., 2004, Very large-scale vehicle routing: New test problems, algorithms, and results, forthcoming in Computers & Operations Research.
Reinelt, G., 2001, TSPLIB; http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/index.html.
Schneider, J., 2002, The time-dependent traveling salesman problem, Physica A. 314:151–155.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Li, F., Golden, B., Wasil, E. (2005). Solving the Time Dependent Traveling Salesman Problem. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Next Wave in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series, vol 29. Springer, Boston, MA . https://doi.org/10.1007/0-387-23529-9_12
Download citation
DOI: https://doi.org/10.1007/0-387-23529-9_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23528-8
Online ISBN: 978-0-387-23529-5
eBook Packages: Computer ScienceComputer Science (R0)