Skip to main content
SpringerLink
Log in

An efficient harris hawk optimization algorithm for solving the travelling salesman problem

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this paper presented a new method that uses random-key encoding to generate a tour. This method helps maintain the main capabilities of the HHO algorithm, on the one hand, and to take advantage of the capabilities of active mechanisms in the continuous-valued problem space on the other hand. For the exploration phase, the DE/best/2 mutation mechanism employed in the exploitation phase, besides the main strategies in the HHO algorithm, was used. Ten neighborhood search operators are used, four of which are introduced. These operators were intelligently selected using the MCF. The Lin-Kernighan local search mechanism was utilized to improve the proposed algorithm's performance, and the Metropolis acceptance strategy was employed to escape the local optima trap. Besides, 80 datasets were evaluated in TSPLIB to demonstrate the performance and efficiency of the proposed algorithm. The results showed the excellent performance of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Vahdat-Nejad, H., Navabi, M.S., Khosravi-Mahmouei, H.: A context-aware museum-guide system based on cloud computing. Int. J. Cloud Appl. Comput. (IJCAC) 8(4), 1–19 (2018)

    Google Scholar 

  2. Sarrab, M., Alshohoumi, F.: Assisted-fog-based framework for iot-based healthcare data preservation. Int. J. Cloud Appl. Comput. (IJCAC) 11(2), 1–16 (2021)

    Google Scholar 

  3. Hossain, K., Rahman, M., Roy, S.: Iot data compression and optimization techniques in cloud storage: current prospects and future directions. Int. J. Cloud Appl. Comput. (IJCAC) 9(2), 43–59 (2019)

    Google Scholar 

  4. Kapgate, D.: Predictive data center selection scheme for response time optimization in cloud computing. Int. J. Cloud Appl. Comput. (IJCAC) 11(1), 93–111 (2021)

    Google Scholar 

  5. Aliyu, M., et al.: Efficient Metaheuristic Population-Based and Deterministic Algorithm for Resource Provisioning Using Ant Colony Optimization and Spanning Tree. International Journal of Cloud Applications and Computing (IJCAC) 10(2), 1–21 (2020)

    Article  MathSciNet  Google Scholar 

  6. Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699–719 (1966)

    Article  MathSciNet  MATH  Google Scholar 

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

  8. Barnhart, C., et al.: Branch-and-price: COLUMN generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. J. Operat. Res. Soc. 31(11), 1017–1023 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)

    Article  MATH  Google Scholar 

  11. Abdollahzadeh, B., Gharehchopogh F.S.: A multi-objective optimization algorithm for feature selection problems. Eng. Comput. (2021) pp. 1-19.

  12. Meng, Q., Zhang, J.: Optimization and application of artificial intelligence routing algorithm. Clust. Comput. 22(4), 8747–8755 (2019)

    Article  Google Scholar 

  13. Gharehchopogh, F.S., Maleki, I., Dizaji, Z.A.: Chaotic vortex search algorithm: metaheuristic algorithm for feature selection. Evol. Intell. (2021) p. 1-32.

  14. Abedi, M., Gharehchopogh, F.S.: An improved opposition based learning firefly algorithm with dragonfly algorithm for solving continuous optimization problems. Intell. Data Anal. 24(2), 309–338 (2020)

    Article  Google Scholar 

  15. Cao, Y., et al.: An improved global best guided artificial bee colony algorithm for continuous optimization problems. Clust. Comput. 22(2), 3011–3019 (2019)

    Article  Google Scholar 

  16. Liu, W., et al.: Improved artificial bee colony algorithm based on self-adaptive random optimization strategy. Clust. Comput. 22(2), 3971–3980 (2019)

    Article  Google Scholar 

  17. Choong, S.S., Wong, L.-P., Lim, C.P.: An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol. Comput. 44, 622–635 (2019)

    Article  Google Scholar 

  18. Drake, J.H., Özcan, E., Burke, E.K.: Modified choice function heuristic selection for the multidimensional knapsack problem. In: Genetic and Evolutionary Computing, pp. 225–234. Springer (2015)

    Chapter  Google Scholar 

  19. Denzinger, J.r. and M. Fuchs, High performance ATP systems by combining several AI methods. 1996.

  20. Burke, E.K., et al.: A classification of hyper-heuristic approaches. In: Handbook of metaheuristics, pp. 449–468. Springer (2010)

    Chapter  Google Scholar 

  21. Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Operat. Res. Soc. 64(12), 1695–1724 (2013)

    Article  Google Scholar 

  22. Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In International Conference on the Practice and Theory of Automated Timetabling. Springer, (2000)

  23. Drake, J.H., Özcan, E., Burke, E.K.: An improved choice function heuristic selection for cross domain heuristic search. in International Conference on Parallel Problem Solving from Nature. Springer, (2012)

  24. Drake, J.H., Özcan, E., Burke, E.K.: A modified choice function hyper-heuristic controlling unary and binary operators. in 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE, (2015)

  25. Özcan, E., et al.: A reinforcement learning: great-deluge hyper-heuristic for examination timetabling, In Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends. pp. 34-55, IGI Global, (2012)

  26. Falcão, D., Madureira, A., Pereira, I.: Q-learning based hyper-heuristic for scheduling system self-parameterization. in 2015 10th Iberian Conference on Information Systems and Technologies (CISTI). IEEE, (2015)

  27. Lin, J., Wang, Z.-J., Li, X.: A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol. Comput. 36, 124–135 (2017)

    Article  Google Scholar 

  28. Dempster, P., Drake, J.H.: Two frameworks for cross-domain heuristic and parameter selection using harmony search. In: Harmony Search Algorithm, pp. 83–94. Springer (2016)

    Chapter  Google Scholar 

  29. Zamli, K.Z., Alkazemi, B.Y., Kendall, G.: A tabu search hyper-heuristic strategy for t-way test suite generation. Appl. Soft Comput. 44, 57–74 (2016)

    Article  Google Scholar 

  30. Jackson, W.G., Özcan, E., Drake, J.H.: Late acceptance-based selection hyper-heuristics for cross-domain heuristic search. In 2013 13th UK Workshop on Computational Intelligence (UKCI). IEEE, (2013)

  31. Kalender, M., et al.: A greedy gradient-simulated annealing selection hyper-heuristic. Soft. Comput. 17(12), 2279–2292 (2013)

    Article  Google Scholar 

  32. Chakhlevitch, K., Cowling, P.: Hyperheuristics: recent developments. In: Adaptive and multilevel metaheuristics, pp. 3–29. Springer (2008)

    Chapter  Google Scholar 

  33. Heidari, A.A., et al.: Harris hawks optimization: algorithm and applications. Futur. Gener. Comput. Syst. 97, 849–872 (2019)

    Article  Google Scholar 

  34. Abd Elaziz, M., et al.: A competitive chain-based Harris Hawks Optimizer for global optimization and multi-level image thresholding problems. Appl. Soft Comput. 106347 (2020)

  35. Hussain, K., Zhu, W., Salleh, M.N.M.: Long-term memory Harrisâ€TM hawk optimization for high dimensional and optimal power flow problems. IEEE Access 7, 147596–147616 (2019)

    Article  Google Scholar 

  36. Zhang, Y., et al.: Boosted binary Harris hawks optimizer and feature selection. Structure 25, 26 (2020)

    Google Scholar 

  37. Hans, R., Kaur, H., Kaur, N.: Opposition-based Harris Hawks optimization algorithm for feature selection in breast mass classification. J. Interdis. Math. 23(1), 97–106 (2020)

    Google Scholar 

  38. Abdel-Basset, M., Ding, W., El-Shahat, D.: A hybrid Harris Hawks optimization algorithm with simulated annealing for feature selection. Artif. Intell. Rev. 1–45 (2020)

  39. Jia, H., et al.: Dynamic harris hawks optimization with mutation mechanism for satellite image segmentation. Remote Sensing 11(12), 1421 (2019)

    Article  Google Scholar 

  40. Abbasi, A., B. Firouzi, and P. Sendur, On the application of Harris hawks optimization (HHO) algorithm to the design of microchannel heat sinks. Engineering with Computers, 2019: p. 1-20.

  41. Reinelt, G.: TSPLIB http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/. (1991)

  42. Gharehchopogh, F.S., Gholizadeh, H.: A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol. Comput. 48, 1–24 (2019)

    Article  Google Scholar 

  43. Gharehchopogh, F.S., Shayanfar, H. Gholizadeh, H.: A comprehensive survey on symbiotic organisms search algorithms. Artif. Intell. Rev. 1-48 (2019)

  44. Gülcü, S., et al.: A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft. Comput. 22(5), 1669–1685 (2018)

    Article  Google Scholar 

  45. Ezugwu, A.E.-S., A.O. Adewumi, and M.E. Frîncu, Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Systems with Applications, 2017. 77: p. 189-210.

  46. Zhong, Y., et al.: Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol. Comput. 42, 77–88 (2018)

    Article  Google Scholar 

  47. Sun, Y., et al.: A new wolf colony search algorithm based on search strategy for solving travelling salesman problem. Int. J. Comput. Sci. Eng. 18(1), 1–11 (2019)

    Google Scholar 

  48. Zhong, Y., et al.: Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem. Swarm Evol. Comput. 48, 134–144 (2019)

    Article  Google Scholar 

  49. Dong, R., et al.: Hybrid optimization algorithm based on wolf pack search and local search for solving traveling salesman problem. J. Shanghai Jiaotong Univ. (Science) 24(1), 41–47 (2019)

    Article  Google Scholar 

  50. Pook, M.F., Ramlan, E.I.: The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem. Evol. Intel. 12(1), 11–20 (2019)

    Article  Google Scholar 

  51. Wang, Y., Wu, Y., Xu, N.: Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem. Comput. Ind. Eng. 131, 269–281 (2019)

    Article  Google Scholar 

  52. Tawhid, M.A., Savsani, P.: Discrete sine-cosine algorithm (DSCA) with local search for solving traveling salesman problem. Arab. J. Sci. Eng. 44(4), 3669–3679 (2019)

    Article  Google Scholar 

  53. Karaboga, D., Gorkemli, B.: Solving traveling salesman problem by using combinatorial artificial bee colony algorithms. Int. J. Artif. Intell. Tools 28(01), 1950004 (2019)

    Article  Google Scholar 

  54. Sahana, S.K.: Hybrid optimizer for the travelling salesman problem. Evol. Intel. 12(2), 179–188 (2019)

    Article  Google Scholar 

  55. Jiang, C., Wan, Z., Peng, Z.: A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst. Appl. 139, 112867 (2020)

    Article  Google Scholar 

  56. Ali, I.M., Essam, D., Kasmarik, K.: A novel design of differential evolution for solving discrete traveling salesman problems. Swarm Evol. Comput. 52, 100607 (2020)

    Article  Google Scholar 

  57. Ebadinezhad, S.: DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Eng. Appl. Artif. Intell. 92, 103649 (2020)

    Article  Google Scholar 

  58. Cinar, A.C., Korkmaz, S., Kiran, M.S.: A discrete tree-seed algorithm for solving symmetric traveling salesman problem. Eng. Sci. Technol. Int. J. 23(4), 879–890 (2020)

    Google Scholar 

  59. George, T., Amudha, T.: Genetic algorithm based multi-objective optimization framework to solve traveling salesman problem. In: Advances in Computing and Intelligent Systems, pp. 141–151. Springer (2020)

    Chapter  Google Scholar 

  60. Yousefikhoshbakht, M., Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm. Complexity, 2021. 2021.

  61. Huang, Y., Shen, X.-N., You, X.: A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem. Appl. Soft Comput. 102, 107085 (2021)

    Article  Google Scholar 

  62. Al-Gaphari, G.H., Al-Amry, R., Al-Nuzaili, A.S.: Discrete crow-inspired algorithms for traveling salesman problem. Eng. Appl. Artif. Intell. 97, 104006 (2021)

    Article  Google Scholar 

  63. Benyamin, A., Farhad, S.G., Saeid, B.: Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems. Int. J. Intell. Syst. 36(3), 1270–1303 (2021)

    Article  Google Scholar 

  64. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154–160 (1994)

    Article  MATH  Google Scholar 

  65. Das, S., Mullick, S.S., Suganthan, P.N.: Recent advances in differential evolution–an updated survey. Swarm Evol. Comput. 27, 1–30 (2016)

    Article  Google Scholar 

  66. Abd Elaziz, M., et al.: Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution. Knowl.-Based Syst. 169, 39–52 (2019)

    Article  Google Scholar 

  67. Jadon, S.S., et al.: Hybrid artificial bee colony algorithm with differential evolution. Appl. Soft Comput. 58, 11–24 (2017)

    Article  Google Scholar 

  68. Xiong, G., et al.: Parameter extraction of solar photovoltaic models by means of a hybrid differential evolution with whale optimization algorithm. Sol. Energy 176, 742–761 (2018)

    Article  Google Scholar 

  69. Pan, Q.-K., et al.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12), 2455–2468 (2011)

    Article  MathSciNet  Google Scholar 

  70. Szeto, W.Y., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215(1), 126–135 (2011)

    Article  Google Scholar 

  71. Liu, X., Su, J., Han, Y.: An improved particle swarm optimization for traveling salesman problem. In International Conference on Intelligent Computing. Springer, (2007)

  72. Wang, K.-P., et al.: Particle swarm optimization for traveling salesman problem. In Proceedings of the 2003 international conference on machine learning and cybernetics (IEEE cat. no. 03ex693). IEEE, (2003)

  73. Irnich, S., Funke, B., GrÃnert, T.: Sequential search and its application to vehicle-routing problems. Comp. Operat. Res. 33(8), 2405–2429 (2006)

    Article  MATH  Google Scholar 

  74. Sha, D., Hsu, C.-Y.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791–808 (2006)

    Article  Google Scholar 

  75. KÄran, M.S., ÄÅŸcan, H.M., GÃndÃz, M.: The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem. Neural Comput. Appl. 23(1), 9–21 (2013)

    Article  Google Scholar 

  76. Cowling, P., Kendall, G., Soubeiga, E.: A parameter-free hyperheuristic for scheduling a sales summit. in Proceedings of the 4th Metaheuristic International Conference, MIC. Citeseer, (2001)

  77. Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  78. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245–2269 (1965)

    Article  MathSciNet  MATH  Google Scholar 

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

  80. Martí, R., et al.: Multi-start methods. Handbook of Heuristics, p. 1-21 (2016)

  81. Li, W.: A parallel multi-start search algorithm for dynamic traveling salesman problem. In International Symposium on Experimental Algorithms. Springer, (2011)

  82. Avci, M., Topaloglu, S.: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem. Comput. Oper. Res. 83, 54–65 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  83. Michallet, J., et al.: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput. Oper. Res. 41, 196–207 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  84. LourenÃo, H.R., Martin, O.C., StÃtzle, T.: Iterated local search: Framework and applications, In Handbook of metaheuristics. Springer. p. 129-168 (2019)

  85. Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82–92 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  86. Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Citeseer, (1991)

  87. Kramer, R., Dell’Amico, M., Iori, M.: A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints. Int. J. Product. Res. 55(21), 6288–6304 (2017)

    Article  Google Scholar 

  88. Subramanian, A., Battarra, M., Potts, C.N.: An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 52(9), 2729–2742 (2014)

    Article  Google Scholar 

  89. Dong, X., et al.: Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem. Comput. Ind. Eng. 87, 176–185 (2015)

    Article  Google Scholar 

  90. Nguyen, S., et al.: Automatic programming via iterated local search for dynamic job shop scheduling. IEEE Trans. Cybernet. 45(1), 1–14 (2014)

    Article  Google Scholar 

  91. Li, J., et al.: Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Syst. Appl. 42(7), 3551–3561 (2015)

    Article  Google Scholar 

  92. Silva, M.M., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the split delivery vehicle routing problem. Comput. Oper. Res. 53, 234–249 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  93. Herrera, B.A.L.D.M., Coelho, L.D.S., Steiner, M.T.A.: Quantum inspired particle swarm combined with lin-kernighan-helsgaun method to the traveling salesman problem. Pesquisa Operacional 35(3), 465–488 (2015)

    Article  Google Scholar 

  94. Wilcoxon, F., Katti, S., Wilcox, R.A.: Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. Select. Tables Math. Statist. 1, 171–259 (1970)

    MATH  Google Scholar 

  95. Zhong, Y., et al.: Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf. Sci. 421, 70–84 (2017)

    Article  MathSciNet  Google Scholar 

  96. Rey, D., Neuhäuser, M.: Wilcoxon-signed-rank test. In: International encyclopedia of statistical science, pp. 1658–1659. Springer, Berlin, Heidelberg (2011)

    Chapter  Google Scholar 

  97. Wang, H., Zhang, N., CrÃput, J.-C.: A massively parallel neural network approach to large-scale Euclidean traveling salesman problems. Neurocomputing 240, 137–151 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran

    Farhad Soleimanian Gharehchopogh & Benyamin Abdollahzadeh

Authors
  1. Farhad Soleimanian Gharehchopogh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benyamin Abdollahzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Farhad Soleimanian Gharehchopogh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gharehchopogh, F.S., Abdollahzadeh, B. An efficient harris hawk optimization algorithm for solving the travelling salesman problem. Cluster Comput 25, 1981–2005 (2022). https://doi.org/10.1007/s10586-021-03304-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-021-03304-5

Keywords

Search

Navigation