Skip to main content
SpringerLink
Log in

Discrete Mother Tree Optimization for the Traveling Salesman Problem

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12533))

Included in the following conference series:

Abstract

The Mother Tree Optimization (MTO) algorithm is a new swarm intelligence technique that we have recently proposed for solving continuous optimization problems. MTO is built on an offspring topology and a set of cooperating agents. In this paper, we first present a discrete version of MTO, that we call Discrete MTO (DMTO), for solving the Traveling Salesman Problem (TSP). DMTO is based on a new swap operation that is best suited for TSPs. We also used this swap operation to introduce an updated version of the Discrete Particle Swarm Optimization (DPSO) algorithm. With a careful application of our new swap operation, we will show that our Updated DPSO (UDPSO) is more effective than DPSO. In order to assess the performance of our proposed methods, DMTO and UPSO, we conducted several experiments comparing both to DPSO and an exact method (Branch and Bound), on ten TSP instances taken from the well-known TSPLIB dataset. The results clearly show that DMTO produces solutions of much better quality than in DPSO, and superior to those in UDPSO.

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 EPUB and 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

References

  1. Beiler, K.J., Durall, D.M., Simard, S.W., Maxwell, S.A., Kretzer, A.M.: Architecture of the wood-wide web: Rhizopogon spp. genets link multiple douglas-fir cohorts. New Phytologist. 185(2), 543–553 (2010)

    Google Scholar 

  2. Bontoux, B., Feillet, D.: Ant colony optimization for the traveling purchaser problem. Comput. Oper. Res. 35(2), 628–637 (2008)

    Article  MathSciNet  Google Scholar 

  3. Books, W.: Summary and Analysis of The Hidden Life of Trees: What They Feel, How They Communicate Discoveries from a Secret World: Based on the Book by Peter Wohlleben. Smart Summaries, Worth Books (2017). https://books.google.ca/books?id=OWmZDgAAQBAJ

  4. Chen, S.M., Chien, C.Y.: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst. Appl. 38(12), 14439–14450 (2011)

    Article  Google Scholar 

  5. Chentsov, A., Korotayeva, L.: The dynamic programming method in the generalized traveling salesman problem. Math. Comput. Model. 25(1), 93–105 (1997)

    Article  MathSciNet  Google Scholar 

  6. Davis, L.: Handbook of Genetic Algorithms. CUMINCAD (1991)

    Google Scholar 

  7. Dechter, R., Cohen, D.: Constraint Processing. Morgan Kaufmann, Burlington (2003)

    Google Scholar 

  8. Dorigo, M., Maniezzo, V., Colorni, A., et al.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B Cybern. 26(1), 29–41 (1996)

    Article  Google Scholar 

  9. Fang, L., Chen, P., Liu, S.: Particle swarm optimization with simulated annealing for TSP. In: Proceedings of the 6th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, pp. 206–210 (2007)

    Google Scholar 

  10. Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21(3), 307–317 (1985)

    Article  MathSciNet  Google Scholar 

  11. Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106(2–3), 539–545 (1998)

    Article  Google Scholar 

  12. Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K.: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl. Soft Comput. 11(4), 3680–3689 (2011)

    Article  Google Scholar 

  13. Gomez-Cabrero, D., Armero, C., Ranasinghe, D.N.: The travelling salesman’s problem: a self-adapting PSO-ACS algorithm. In: 2007 International Conference on Industrial and Information Systems, pp. 479–484. IEEE (2007)

    Google Scholar 

  14. Gündüz, M., Kiran, M.S., Özceylan, E.: A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. 23(1), 103–117 (2015)

    Article  Google Scholar 

  15. Hadia, S.K., Joshi, A.H., Patel, C.K., Kosta, Y.P.: Solving city routing issue with particle swarm optimization. Int. J. Comput. Appl. 47(15) (2012)

    Google Scholar 

  16. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  Google Scholar 

  17. Karaboga, D., Gorkemli, B.: A combinatorial artificial bee colony algorithm for traveling salesman problem. In: 2011 International Symposium on Innovations in Intelligent Systems and Applications, pp. 50–53. IEEE (2011)

    Google Scholar 

  18. Korani, W., Mouhoub, M., Spiteri, R.J.: Mother tree optimization. In: 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 2206–2213. IEEE (2019)

    Google Scholar 

  19. Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artif. Intell. Rev. 13(2), 129–170 (1999)

    Article  Google Scholar 

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

  21. Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for the Euclidean traveling salesman problem. Inf. Sci. 181(20), 4684–4698 (2011)

    Article  MathSciNet  Google Scholar 

  22. Mouhoub, M., Wang, Z.: Ant colony with stochastic local search for the quadratic assignment problem. In: 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), pp. 127–131. IEEE (2006)

    Google Scholar 

  23. Padberg, M., Rinaldi, G.: Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett. 6(1), 1–7 (1987)

    Article  MathSciNet  Google Scholar 

  24. Pang, W., et al.: Modified particle swarm optimization based on space transformation for solving traveling salesman problem. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 04EX826), vol. 4, pp. 2342–2346. IEEE (2004)

    Google Scholar 

  25. Qu, L., Sun, R.: A synergetic approach to genetic algorithms for solving traveling salesman problem. Inf. Sci. 117(3–4), 267–283 (1999)

    Article  Google Scholar 

  26. Radharamanan, R., Choi, L.: A branch and bound algorithm for the travelling salesman and the transportation routing problems. Comput. Ind. Eng. 11(1–4), 236–240 (1986)

    Article  Google Scholar 

  27. Reinelt, G.: Tsplib discrete and combinatorial optimization (1995). http://comopt.ifi.uniheidelberg.de/software/TSPLIB95

  28. Sanches, D., Whitley, D., Tinós, R.: Improving an exact solver for the traveling salesman problem using partition crossover. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 337–344 (2017)

    Google Scholar 

  29. Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74. Wiley, New York (2009)

    Google Scholar 

  30. Zweig, G.: An effective tour construction and improvement procedure for the traveling salesman problem. Oper. Res. 43(6), 1049–1057 (1995)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Regina, Regina, Canada

    Wael Korani & Malek Mouhoub

Authors
  1. Wael Korani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malek Mouhoub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Malek Mouhoub .

Editor information

Editors and Affiliations

  1. Department of AI, Ping An Life, Shenzhen, China

    Haiqin Yang

  2. Faculty of Information Technology, King Mongkut’s Institute of Technology Ladkrabang, Bangkok, Thailand

    Kitsuchart Pasupa

  3. City University of Hong Kong, Kowloon, China

    Andrew Chi-Sing Leung

  4. Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong, Hong Kong

    James T. Kwok

  5. School of Information Technology, King Mongkut’s University of Technology Thonburi, Bangkok, Thailand

    Jonathan H. Chan

  6. The Chinese University of Hong Kong, New Territories, Hong Kong

    Irwin King

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Korani, W., Mouhoub, M. (2020). Discrete Mother Tree Optimization for the Traveling Salesman Problem. In: Yang, H., Pasupa, K., Leung, A.CS., Kwok, J.T., Chan, J.H., King, I. (eds) Neural Information Processing. ICONIP 2020. Lecture Notes in Computer Science(), vol 12533. Springer, Cham. https://doi.org/10.1007/978-3-030-63833-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-63833-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-63832-0

  • Online ISBN: 978-3-030-63833-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation