Skip to main content
SpringerLink
Log in

Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem

  • Conference paper
  • First Online:
Mathematics and Computing (ICMC 2017)

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

Included in the following conference series:

Abstract

In this paper combining the features of swap sequence and swap operation based Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and K-Opt operation a hybrid algorithm is proposed to solve well known Traveling Salesman Problem (TSP). Interchange of two cities of a path of a TSP is known as swap operation and a sequence of such operations is called swap sequence. Using swap operation and swap sequence PSO operations are redefined to solve TSP. Here ACO is used a small number of iterations to generate initial swarm of PSO. Then PSO operations are made on this swarm a sufficient number of times to find optimal path. During PSO iterations if a particle does not change its position for a predefined number of iterations then K-Opt operation is made on it a finite number of times to improve its position. The algorithm is tested with bench mark test problems from TSPLIB and it is observed that algorithm is more efficient with respect to accuracy as well as execution time to solve standard TSPs (Symmetric as well as Asymmetric) compared to existing algorithms. Details of the proposed algorithm along with swap operation, swap sequence and K-opt operation for the algorithm are elaborately discussed for the readers.

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

References

  1. Akhand, M.A.H., Akter, S., Rashid, M.A.: Velocity tentative particle swarm optimization to solve TSP. In: 2013 International Conference on Electrical Information and Communication Technology (EICT), pp. 1–6. IEEE Conference Publications (2014)

    Google Scholar 

  2. Angeline, P.J.: Evolutionary optimization versus particle swarm optimization: philosophy and performance differences. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds.) EP 1998. LNCS, vol. 1447, pp. 601–610. Springer, Heidelberg (1998). doi:10.1007/BFb0040811

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Changdar, C., Mahapatra, G.S., Pal, R.: An efficient genetic algorithm for multi-objective solid traveling salesman problem under fuzziness. Swarm Evol. Comput. 15, 27–37 (2014)

    Article  Google Scholar 

  5. 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, 14439–14450 (2011)

    Article  Google Scholar 

  6. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of large scale traveling salesman problem. Oper. Res. 2, 393–410 (1954)

    MathSciNet  Google Scholar 

  7. Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, London (1999)

    Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. Biosystems 43, 73–81 (1997)

    Article  Google Scholar 

  9. Dorigo, M., Maniezzo, V., Colorni, A.: 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 

  10. Eberhart, R., Kennedy, J.: A new optimizer using particles swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine, Human Science, Nagoya, Japan, pp. 39–43. IEEE Service Center, Piscataway (1995)

    Google Scholar 

  11. Fan, H.: Discrete particle swarm optimization for TSP based on neighborhood. J. Comput. Inf. Syst. (JCIS) 6, 3407–3414 (2010)

    Google Scholar 

  12. Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. 14, 403–417 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  14. Guchhait, P., Maiti, M.K., Maitia, M.: Two storage inventory model of a deteriorating item with variable demand under partial credit period. Appl. Soft Comput. 13, 428–448 (2013)

    Article  Google Scholar 

  15. Guchhait, P., Maiti, M.K., Maitia, M.: Inventory model of a deteriorating item with price and credit linked fuzzy demand: a fuzzy differential equation approach. Oper. Res. Soc. India 51(3), 321–353 (2013)

    MathSciNet  MATH  Google Scholar 

  16. Gunduz, M., Kiran, M.S., Ozceylan, E.: A hierarchic approach based on swarm intelligence to solve traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. 23, 103–117 (2015)

    Article  Google Scholar 

  17. Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1, 119–163 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithm for routing and scheduling problems with general time window constraints. Transp. Sci. 39(2), 206–232 (2005)

    Article  Google Scholar 

  19. Junqiang, W., Aijia, O.: A hybrid algorithm of ACO and delete-cross method for TSP. In: 2012 International Conference on Industrial Control and Electronics Engineering (ICICEE), pp. 1694–1696. IEEE (2012)

    Google Scholar 

  20. Jolai, F., Ghanbari, A.: Integrating data transformation techniques with Hopfield neural networks for solving traveling salesman problem. Expert Syst. Appl. 37, 5331–5335 (2010)

    Article  Google Scholar 

  21. 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, Istanbul, Turkey

    Google Scholar 

  22. Kennedy, J., Eberhart, R.: Particle swarm optimization. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)

    Google Scholar 

  23. Khanra, A., Maiti, M.K., Maiti, M.: Profit maximization of TSP through a hybrid algorithm. Comput. Ind. Eng. 88, 229–236 (2015)

    Article  Google Scholar 

  24. Lopez-Ibanez, M., Blum, C.: Beam-ACO for the traveling salesman problem with time windows. Comput. Oper. Res. 37(9), 1570–1583 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  25. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)

    MATH  Google Scholar 

  26. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. J. Evol. Comput. 10(3), 281–295 (2006)

    Article  Google Scholar 

  27. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  28. Majumdar, J., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235(9), 3063–3078 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  29. Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic traveling salesman problem with traffic factors. Appl. Soft Comput. 13(10), 4023–4037 (2013)

    Article  Google Scholar 

  30. Mahi, M., Baykan, O.K., Kodaz, H.: A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem. Appl. Soft Comput. 30, 484–490 (2015)

    Article  Google Scholar 

  31. Masutti, T.A.S., de Castro, L.N.: A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf. Sci. 179(10), 1454–1468 (2009)

    Article  MathSciNet  Google Scholar 

  32. Miliotis, P.: Using cutting planes to solve the symmetric travelling salesman problem. Math. Program. 15, 177–188 (1978). North-Holland Publishing Company

    Article  MathSciNet  MATH  Google Scholar 

  33. Moon, C., Kim, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606–617 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  34. Nguyen, H.D., Yoshihara, I., Yamamori, K., Yasunaga, M.: Implementation of an effective hybrid GA for large scale traveling salesman problem. IEEE Trans. Syst. Man Cybern. Part-B Cybern. 37(1), 92–99 (2007)

    Article  Google Scholar 

  35. Othman, Z.A., Srour, A.I., Hamdan, A.R., Ling, P.Y.: Performance water flow-like algorithm for TSP by improving its local search. Int. J. Adv. Comput. Technol. 5(14), 126 (2013)

    Google Scholar 

  36. Petberg, M.W., Homg, S.: On the symmetric traveling salesman problems: a computational study. Math. Program. Stud. 12, 87–107 (1980)

    Google Scholar 

  37. Pasti, R., De Castro, L.N.: A Neuro-immune network for solving the traveling salesman problem. In: Proceedings of International Joint Conference on Neural Networks, IJCNN 2006, pp. 3760–3766 (2006)

    Google Scholar 

  38. Petersen, H.L., Madsen, O.B.G.: The double traveling salesman problem within multiple stack formulation and heuristic solution approaches. Eur. J. Oper. Res. 198, 339–347 (2009)

    Article  Google Scholar 

  39. 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  MATH  Google Scholar 

  40. Sierksma, G.: Hamiltonicity and the 3-OPT procedure for the traveling salesman problem. Appl. Math. 22(2), 351–358 (2014)

    MathSciNet  MATH  Google Scholar 

  41. Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103(5), 169–176 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  42. Tsai, C.F., Tsai, C.W., Tseng, C.C.: A new hybrid heuristic approach for solving large traveling salesman problem. Inf. Sci. 166, 67–81 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  43. Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. Int. Conf. Mach. Learn. Cybern. 3, 1583–1585 (2003)

    Google Scholar 

  44. Yan, X., Zhang, C., Luo, W., Li, W., Chen, W., Liu, H.: Solve traveling salesman problem using particle swarm optimization algorithm. Int. J. Comput. Sci. Issues 9(6), 264–271 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chandrakon Vidyasagar Mahavidyalaya, Paschim-Medinipur, 721201, West Bengal, India

    Indadul Khan

  2. Department of Mathematics, Mahishadal Raj College, Mahishadal, Purba-Medinipur, 721628, West Bengal, India

    Manas Kumar Maiti

  3. Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Paschim-Medinipur, West Bengal, India

    Manoranjan Maiti

Authors
  1. Indadul Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manas Kumar Maiti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manoranjan Maiti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Indadul Khan .

Editor information

Editors and Affiliations

  1. Haldia Institute of Technology, Haldia, India

    Debasis Giri

  2. University of Central Florida, Orlando, Florida, USA

    Ram N. Mohapatra

  3. Freie Universität Berlin, Berlin, Germany

    Heinrich Begehr

  4. Fordham University, Bronx, New York, USA

    Mohammad S. Obaidat

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Khan, I., Maiti, M.K., Maiti, M. (2017). Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem. In: Giri, D., Mohapatra, R., Begehr, H., Obaidat, M. (eds) Mathematics and Computing. ICMC 2017. Communications in Computer and Information Science, vol 655. Springer, Singapore. https://doi.org/10.1007/978-981-10-4642-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4642-1_10

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4641-4

  • Online ISBN: 978-981-10-4642-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation