Skip to main content
SpringerLink
Log in

A Hybrid Algorithm of n-OPT and GA to Solve Dynamic TSP

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3033))

Included in the following conference series:

Abstract

We proposed the concept dynamic traveling salesman problem (Dynamic TSP). According to the characteristics of Dynamic TSP, we used a hybrid algorithm of n-OPT and GA to solve it. 2-OPT and 3-OPT are used in GA procedures of mutation and selection. The productivity and quality of solutions under dynamic conditions are evaluated by the experiment.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. Computers and Intractability (1979)

    Google Scholar 

  2. Burkard, R.E., Deineko, V.G., Dal, R.V.: Well-Solvable Special Cases of the Traveling Salesman Problem: a survey. SIAM Review, 496–546 (1998)

    Google Scholar 

  3. Keld, H.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Datalogiske Skrifter (1998)

    Google Scholar 

  4. Giuseppe, P.: The Period Traveling Salesman Problem: a new heuristic algorithm. Computers & Operations Research 29, 1343–1352 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Laporte, Semet, F.: Computational Evaluation of a Transformation Procedure for the Symmetric Generalized Traveling Salesman Problem (1999)

    Google Scholar 

  6. Renaud, J., Boctor, F.F., Laporte, G.: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS Journal on Computing, 134–143 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, China University of Geosciences, 430074, Wuhan, Hubei, China

    Zhao Liu

  2. Department of Computer Science and Technology, China University of Geosciences, 430074, Wuhan, Hubei, China

    Lishan Kang

Authors
  1. Zhao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lishan Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiatong University, 80 Dongcuan Road, 200240, Shanghai, China

    Minglu Li

  2. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

    Xian-He Sun

  3. Department. of Computer Science, Shanghai Jiaotong University, 1954 HuaShan Road, 200030, Shanghai, P.R. China

    Qianni Deng

  4. Department of Computer Science, College of Liberal Arts and Science, University of Iowa, IA 52242, Iowa City, USA

    Jun Ni

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Z., Kang, L. (2004). A Hybrid Algorithm of n-OPT and GA to Solve Dynamic TSP. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_161

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24680-0_161

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21993-4

  • Online ISBN: 978-3-540-24680-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation