Skip to main content
SpringerLink
Log in

A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2008)

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

Included in the following conference series:

Abstract

This paper presents a novel hybrid ant colony optimization approach (ACO&PR) to solve the traveling salesman problem (TSP). The main feature of this hybrid algorithm is to hybridize the solution construction mechanism of the ACO with path relinking (PR), an evolutionary method, which introduces progressively attributes of the guiding solution into the initial solution to obtain the high quality solution as quickly as possible. Moreover, the hybrid algorithm considers both solution diversification and solution quality, and it adopts the dynamic updating strategy of the reference set and the criterion function restricting the frequencies of using the path-relinking procedure to accelerate the convergence towards high-quality regions of the search space. Finally, the experimental results for benchmark TSP instances have shown that our proposed method is very efficient and competitive to solve the traveling salesman problem compared with the best existing methods in terms of solution quality.

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

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. Siqueira, P.H., Steiner, M.T.A., Scheer, S.: A New Approach to Solve the Traveling Salesman Problem. Neurocomputing 70, 1013–1021 (2007)

    Google Scholar 

  2. Glover, F.: Tabu Search-part II. ORSA Journal of Computing 12(1), 4–32 (1990)

    Google Scholar 

  3. Affenzeller, M., Wanger, S.: A Self-adaptive Model for Selective Pressure Handling within the Theory of Genetic Algorithms. In: Moreno-Díaz Jr., R., Pichler, F. (eds.) EUROCAST 2003. LNCS, vol. 2809, pp. 384–393. Springer, Heidelberg (2003)

    Google Scholar 

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

    Article  Google Scholar 

  5. Liu, G., He, Y., Fang, Y., Oiu, Y.: A Novel Adaptive Search Strategy of Intensification and Diversification in tabu search. In: Proceedings of Neural Networks and Signal Processing, Nanjing, China (2003)

    Google Scholar 

  6. Baraglia, R., Hidalgo, Perego, R.: A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Transactions on evolutionary computation 5(6), 613–622 (2001)

    Article  Google Scholar 

  7. Clolrni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Proceedings of the First European Conference of Artificial Life (ECAL 1991), pp. 134–142. Elsevier, Amsterdam (1991)

    Google Scholar 

  8. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 26(1), 29–41 (1996)

    Article  Google Scholar 

  9. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43, 73–81 (1997)

    Article  Google Scholar 

  10. Chu, S.C., Roddick, J.F., Pan, J.S.: Ant Colony System with Communication Strategies. Information Science 167(1-4), 63–76 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Maniezzo, V., Colorni, A.: The Ant System Applied to the Quadratic Assignment Problem. IEEE Transactions on Knowledge and Data Engineering 11(5), 769–778 (1999)

    Article  Google Scholar 

  12. Bulleneimer, B., Hartl, R.F., Strauss, C.: An Improved Ant System Algorithm for the Vehicle Routing Problem. Annals of Operation Research, 89319–89328 (1999)

    Google Scholar 

  13. Marti, M., Laguna, M., Glover, F.: Principles of Scatter Search. European Journal of Operational Research 169, 359–372 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. Glover, F., Laguna, M., Marti, M.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics 39(3), 653–684 (2000)

    MathSciNet  Google Scholar 

  15. Ho, S.C., Gendreau, M.: Path Relinking for the Vehicle Routing Problem. Journal of Heuristics 12, 55–72 (2000)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Logistics Institute, Northeastern University, Shenyang, China

    Xiaoxia Zhang & Lixin Tang

Authors
  1. Xiaoxia Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lixin Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, X., Tang, L. (2008). A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85984-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85983-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation