A New Approach to Solving Dynamic Traveling Salesman Problems

  • Changhe Li
  • Ming Yang
  • Lishan Kang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)


The Traveling Salesman Problem (TSP) is one of the classic NP hard optimization problems. The Dynamic TSP (DTSP) is arguably even more difficult than general static TSP. Moreover the DTSP is widely applicable to real-world applications, arguably even more than its static equivalent. However its investigation is only in the preliminary stages. There are many open questions to be investigated. This paper proposes an effective algorithm to solve DTSP. Experiments showed that this algorithm is effective, as it can find very high quality solutions using only a very short time step.


Gene Pool Minimum Span Tree Travel Salesman Problem Travel Salesman Problem Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Eyckelhof, C.J., Snoek, M.: Ant Systems for a Dynamic TSP -Ants caught in a traffic jam. In: 3rd International Workshop on Ant Algorithms (2002)Google Scholar
  2. 2.
    Huang, Z.C., Hu, X.L., Chen, S.D.: Dynamic Traveling Salesman Problem based on Evolutionary Computation. In: Congress on Evolutionary Computation (CEC 2001), pp. 1283–1288. IEEE Press, Los Alamitos (2001)Google Scholar
  3. 3.
    Larsen, A.: The Dynamic Vehicle Routing Problem. Ph.D theis, Department of MathematicalModelling (IMM) at the Technical University of Denmark (DTU) (2001)Google Scholar
  4. 4.
    Zhou, A.M., Kang, L.S., Yan, Z.Y.: Solving Dynamic TSP with Evolutionary Approach in Real Time. In: Proceedings of the Congress on Evolutionary Computation, Canberra, Austrilia, December 8-12, 2003, pp. 951–957. IEEE Press, Los Alamitos (2003)CrossRefGoogle Scholar
  5. 5.
    Psaraftis, H.N.: Dynamic vehicle routing problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicles Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam (1988)Google Scholar
  6. 6.
    Guo, T., Michalewize, Z.: Inver-over Operator for the TSP. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, Springer, Heidelberg (1998)Google Scholar
  7. 7.
    Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Department of Computer Science Roskilde UniversityGoogle Scholar
  8. 8.
    Kang, L.S., Xie, Y., You, S.Y., et al.: Nonnumerical Parallel Algorithms:Simulated Annealing Algorithm. Science Press, Beijing (1997)Google Scholar
  9. 9.
    Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell System Tech. J. 44, 2245–2269 (1965)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem (1973)Google Scholar
  11. 11.
    Kang, L., Zhou, A., McKay, B., Kang, Y.L.Z.: Benchmarking Algorithms for Dynamic Travelling Salesman Problems. In: Proceedings, Congress on Evolutionary Computation, Portland, Oregon (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Changhe Li
    • 1
  • Ming Yang
    • 1
  • Lishan Kang
    • 1
  1. 1.China University of Geosciences(Wuhan) School of ComputerWuhanP.R. China

Personalised recommendations