Skip to main content
SpringerLink
Log in

Iteration Multilevel Method for the Travelling Salesman Problem

  • Conference paper
Book cover Knowledge-Based Software Engineering (JCKBSE 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 466))

Included in the following conference series:

Abstract

This document presents iteration multilevel method of solving the travelling salesman problem. The multilevel method reduces graph dimension (reduction phase), searches for a solution with a coarse graph and consistently restores the obtained solution on the source graph (restoration phase). The suggested iteration approach allows to improve the originally obtained cycle through multiple reduction and restoring the problem. The results obtained during testing testify of perspective of this approach.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)

    Chapter  Google Scholar 

  2. Carpaneto, G., Fischetti, M., Toth, P.: New lower bounds for the symmetric travelling salesman problem. Mathematical Programming 45, 233–254 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Carpaneto, G., Toth, P.: Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science 26, 736–743 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Admin (1976)

    Google Scholar 

  5. Norback, J., Love, R.: Heuristic for the Hamiltonian path problem in Euclidean two space. Journal of the Operational Research Society 30, 363–368 (1979)

    Article  MATH  Google Scholar 

  6. Karp, R.M.: A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM Journal on Computing 8, 561–573 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)

    Article  MATH  Google Scholar 

  8. Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the TravelingSalesman Problem. Operations Res. 21, 498–516 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  9. Grefenstette, J., et al.: Genetic algorithms for the traveling salesman problem. In: Proc. Intern. Conf. of Genetic Algorithms and their Applications, pp. 160–165 (1985)

    Google Scholar 

  10. Dorigo, M., Stutzle, T.: Ant Colony Optimization. Massachusetts Institute of Technology (2004)

    Google Scholar 

  11. Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998a)

    Article  MathSciNet  Google Scholar 

  12. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Tech. (1970)

    Google Scholar 

  13. Walshaw, C.: A Multilevel Approach to the Graph Colouring Problem. Technical Report01/IM/69, Comp. Math. Sci., University Greenwich, London, UK ( May 2001b)

    Google Scholar 

  14. Traveling salesman problem library (TSPLIB) at the University of Heidelberg, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics and Cybernetics, Informatics and Scientific Research Automation, Lobachevsky State University, Nizhny Novgorod, Russia

    Nikolay V. Starostin & Ilya V. Klyuev

Authors
  1. Nikolay V. Starostin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilya V. Klyuev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Volgograd State Technical University, Lenin av., 64/1, k.20, Volgograd, Russia

    Alla Kravets

  2. Volgograd State Technical University, Lenin av., 28, k.1406, Volgograd, Russia

    Maxim Shcherbakov

  3. Volgograd State Technical University, Lenin av., 28, k.904, Volgograd, Russia

    Marina Kultsova

  4. Department of Administration Engineering, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, P.O. Box, 223-8522, Yokohama-shi, Kanagawa-ken, Japan

    Tadashi Iijima

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Starostin, N.V., Klyuev, I.V. (2014). Iteration Multilevel Method for the Travelling Salesman Problem. In: Kravets, A., Shcherbakov, M., Kultsova, M., Iijima, T. (eds) Knowledge-Based Software Engineering. JCKBSE 2014. Communications in Computer and Information Science, vol 466. Springer, Cham. https://doi.org/10.1007/978-3-319-11854-3_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11854-3_41

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11853-6

  • Online ISBN: 978-3-319-11854-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation