Skip to main content
Springer Nature Link
Log in

An Improved Multi-agent Approach for Solving Large Traveling Salesman Problem

  • Conference paper
Agent Computing and Multi-Agent Systems (PRIMA 2006)

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

Included in the following conference series:

  • 1000 Accesses

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 pro- poses an improved multi-agent approach for solving large TSP. This proposed approach mainly includes three kinds of agents with different function. The first kind of agent is conformation agent and its function is generating the new solution continuously. The second kind of agent is optimization agent and its function is optimizing the current solutions group. The third kind of agent is refining agent and its function is refining the best solution from the beginning of the trial. At same time, there are many sub-agents in each kind of agent. These sub-agents accomplish the task of its superior agent cooperatively. At the end of this paper, 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

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. Deineko, V.G., Hoffmann, M., Okamoto, Y., et al.: The Traveling Salesman Problem with Few Inner Points. Operations Research Letters 34(1), 106–110 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Caro, G.D., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research 9(12), 317–365 (1998)

    MATH  Google Scholar 

  3. 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, Part B: Cybernetics 34(4), 1718–1729 (2004)

    Article  Google Scholar 

  4. Leung, K.S., Jin, H.D., Xu, Z.B.: An Expanding Self-organizing Neural Network for the Traveling Salesman Problem. Neurocomputing 62(1), 267–292 (2004)

    Article  Google Scholar 

  5. Gendreau, M., Laporte, G., Semet, F.: Tabu Search Heuristic for the Undirected Selective Traveling Salesman Problem. European Journal of Operational Research 106(2), 539–545 (1998)

    Article  MATH  Google Scholar 

  6. Budinich, M.: Self-organizing Neural Network for the Traveling Salesman Problem that is Competitive with Simulated Annealing. Neural Computation 8(2), 416 (1996)

    Article  Google Scholar 

  7. Wang, Y.P., Han, L.X., Li, Y.H.: A New Encoding based Genetic Algorithm for the Traveling Salesman Problem. Engineering Optimization 38(1), 1–13 (2006)

    Article  MathSciNet  Google Scholar 

  8. Ahuja, R.K., Orlin, J.B., Tiwari, A.: Greedy Genetic Algorithm for the Quadratic Assignment Problem. Computers and Operations Research 27(10), 917–934 (2002)

    Article  MathSciNet  Google Scholar 

  9. Laporte, G.: The Traveling Salesman Problem: an Overview of Exact and Approximate Algorithms. European Journal of Operational Research 59(2), 231–247 (1992)

    Article  MATH  Google Scholar 

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

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

    MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

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

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

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

  18. Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agent. IEEE Transactions on System, Man, and Cybernetics, Part B: Cybernetics 26(1), 29–42 (1996)

    Article  Google Scholar 

  19. Tsai, C.F., Tsai, C.W., Tseng, C.C.: A New Hybrid Heuristic Approach for Solving Large Traveling Salesman Problem. Information Sciences 166(1), 67–81 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

  21. Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3(4), 376–384 (1991)

    MATH  Google Scholar 

  22. Smith, K.: Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research. INFORMS Journal Computer 11(1), 15–34 (1999)

    Article  MATH  Google Scholar 

  23. Aras, N., Oommen, J., Altinel, I.K.: Kohonen Network Incorporating Explicit Statistics and Its Application to the Traveling Salesman Problem. Neural Networks 12(9), 1273–1284 (1999)

    Article  Google Scholar 

  24. Altinel, I.K., Aras, N., Oommen, J.: Fast, Efficient and Accurate Solutions to the Hamiltonian Path Problem Using Neural Approaches. Computer and Operations Research 27(5), 461–494 (2000)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  26. Casermeiro, E.M., Marin, G.G., Perez, J.M.: An Efficient Multi-valued Hopfield Network for the Traveling Salesman Problem. Neural Processing Letters 14(2), 203–216 (2001)

    Article  MATH  Google Scholar 

  27. Coy, S.P., Golden, B.L., Wasil, E.A.: A Computational Study of Smoothing Heuristics for the Traveling Salesman Problem. European Journal of Operational Research 124(2), 15–27 (1999)

    MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Beijing Institute, of Technology, Beijing, 100081, China

    Yu-An Tan, Xue-Lan Zhang & Shu-Wu Wang

  2. Information management college, Shandong Economic University, Jinan, 250014, P.R. China

    Xin-Hua Zhang

  3. The Department of Management, School of Information System and Management, National University of Defense Technology, Changsha, 410073, P.R. China

    Li-Ning Xing

Authors
  1. Yu-An Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin-Hua Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li-Ning Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xue-Lan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shu-Wu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing

    Zhong-Zhi Shi

  2. Asian Institute of Technology, P.O. Box 4, 12120, Klong Luang, Pathumthani, Thailand

    Ramakoti Sadananda

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, YA., Zhang, XH., Xing, LN., Zhang, XL., Wang, SW. (2006). An Improved Multi-agent Approach for Solving Large Traveling Salesman Problem. In: Shi, ZZ., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2006. Lecture Notes in Computer Science(), vol 4088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802372_34

Download citation

  • DOI: https://doi.org/10.1007/11802372_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36707-9

  • Online ISBN: 978-3-540-36860-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics