Skip to main content
SpringerLink
Log in

Three-Tier Multi-agent Approach for Solving Traveling Salesman Problem

  • Conference paper
PRICAI 2006: Trends in Artificial Intelligence (PRICAI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4099))

Included in the following conference series:

Abstract

The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-hard, and is an often-used benchmark for new optimization techniques.This paper will to bring up a three-tier multi-agent approach for solving the TSP. This proposed approach supports the distributed solving to the TSP. It divides into three-tier (layer), the first tier is ant colony optimization agent and its function is generating the new solution continuously; the second-tier is genetic algorithm agent, its function is optimizing the current solutions group; and the third tier is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. Ultimately, the experimental results have shown that the proposed hybrid approach has good performance with respect to the quality of solution and the speed of computation.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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. Laporte, G.: The Traveling Salesman Problem: an Overview of Exact and Approximate Algorithms. European Journal of Operational Research 59(3), 231–247 (1992)

    Article  MATH  Google Scholar 

  2. Padberg, M., Rinaldi, G.: Optimization of a 532-city Symmetric Genetic Traveling Salesman Problem by Branch and Cut. Operational Research Letters 6(1), 1–7 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Croes, G.A.: A Method for Solving Traveling Salesman Problems. Operational Research 6(6), 791–812 (1958)

    MathSciNet  Google Scholar 

  4. Lin, S.: Computer Solution of the Traveling Salesman Problem. Bell System Technology Journal 44(5), 2245–2269 (1965)

    MATH  Google Scholar 

  5. Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operational Research 21(2), 498–516 (1973)

    MATH  MathSciNet  Google Scholar 

  6. Martin, O., Otto, S.W.: Combining Simulated Annealing with Local Search Heuristic. Annual Operational Research 63(2), 57–75 (1996)

    Article  MATH  Google Scholar 

  7. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)

    MATH  Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  9. Aras, N., Altinel, I.K., Oommen, J.: A Kohonen-Like Decomposition Method for the Euclidean Traveling Salesman Problem-KNIES_DECOMPOSE. IEEE Transactions on Neural Network 14(4), 869–890 (2003)

    Article  Google Scholar 

  10. Buriol, L., Franca, P.M.: A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. Journal of Heuristics 10(3), 483–506 (2004)

    Article  MATH  Google Scholar 

  11. Martin, O., Otto, S.W., Felten, E.W.: Large Step Markov Chain for the Traveling Salesman. Journal of Complex System 5(3), 299 (1991)

    MATH  MathSciNet  Google Scholar 

  12. Baraglia, R., Hidalgo, J.I., Perego, R.: A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 5(6), 613–622 (2001)

    Article  Google Scholar 

  13. Pepper, J.W., Golden, B.L., Wasil, E.A.: Solving the Traveling Salesman Problem with Annealing-Based Heuristics: A Computational Study. IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans 32(1), 72–77 (2002)

    Article  Google Scholar 

  14. Voudouris, C., Tsang, E.: Guided Local Search and its Application to the Traveling Salesman Problem. European Journal of Operational Research 113(2), 469–499 (1999)

    Article  MATH  Google Scholar 

  15. Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. European Journal of Operational Research 126(1), 106–130 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Tsai, H.K., Yang, J.M., Tsai, Y.F., et al.: An Evolutionary Algorithm for Large Traveling Salesman Problems. IEEE Transactions on Systems, Man and Cybernetics 34(4), 1718–1729 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering & Technology Center, Southwest University of Science and Technology, Mianyang, 621010, P.R. China

    Shi-Liang Yan

  2. Department of computer science, Qiu-Ai Experimental Elementary School, Ningbo, 315153, P.R. China

    Ke-Feng Zhou

Authors
  1. Shi-Liang Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ke-Feng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Hong Kong University of Science and Technology,, Hong Kong

    Qiang Yang

  2. Clayton School of Information Technology, Monash University, P.O. Box, Australia

    Geoff Webb

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yan, SL., Zhou, KF. (2006). Three-Tier Multi-agent Approach for Solving Traveling Salesman Problem. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_86

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-36668-3_86

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36667-6

  • Online ISBN: 978-3-540-36668-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation