Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A New Approach to Solving Dynamic Traveling Salesman Problems

  • Conference paper
Simulated Evolution and Learning (SEAL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4247))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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. 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. 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)

    Chapter  Google Scholar 

  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. 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. Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Department of Computer Science Roskilde University

    Google Scholar 

  8. Kang, L.S., Xie, Y., You, S.Y., et al.: Nonnumerical Parallel Algorithms:Simulated Annealing Algorithm. Science Press, Beijing (1997)

    Google Scholar 

  9. Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell System Tech. J. 44, 2245–2269 (1965)

    MATH  MathSciNet  Google Scholar 

  10. Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem (1973)

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. China University of Geosciences(Wuhan) School of Computer, 430074, Wuhan, P.R. China

    Changhe Li, Ming Yang & Lishan Kang

Authors
  1. Changhe Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lishan Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung County Taiwan, ROC

    Tzai-Der Wang

  2. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  3. AI-ECON Research Center, Department of Economics, National Chengchi University, 11623, Taipei, Taiwan

    Shu-Heng Chen

  4. Department of Computer Science and Technology, University of Sci. & Tech. of China, 230026, Hefei, Anhui, P.R. China

    Xufa Wang

  5. School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, Australia

    Hussein Abbass

  6. The Univertity of Tokyo, Japan

    Hitoshi Iba

  7. Department of Computer, University of Science and Technology of China, 230027, Hefei, China

    Guo-Liang Chen

  8. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, C., Yang, M., Kang, L. (2006). A New Approach to Solving Dynamic Traveling Salesman Problems. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_31

Download citation

  • DOI: https://doi.org/10.1007/11903697_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47331-2

  • Online ISBN: 978-3-540-47332-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation