{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T19:32:54Z","timestamp":1777404774293,"version":"3.51.4"},"reference-count":97,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10586-021-03304-5","type":"journal-article","created":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T15:15:57Z","timestamp":1622474157000},"page":"1981-2005","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["An efficient harris hawk optimization algorithm for solving the travelling salesman problem"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1588-1659","authenticated-orcid":false,"given":"Farhad Soleimanian","family":"Gharehchopogh","sequence":"first","affiliation":[]},{"given":"Benyamin","family":"Abdollahzadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,31]]},"reference":[{"issue":"4","key":"3304_CR1","first-page":"1","volume":"8","author":"H Vahdat-Nejad","year":"2018","unstructured":"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\u201319 (2018)","journal-title":"Int. J. Cloud Appl. Comput. (IJCAC)"},{"issue":"2","key":"3304_CR2","first-page":"1","volume":"11","author":"M Sarrab","year":"2021","unstructured":"Sarrab, M., Alshohoumi, F.: Assisted-fog-based framework for iot-based healthcare data preservation. Int. J. Cloud Appl. Comput. (IJCAC) 11(2), 1\u201316 (2021)","journal-title":"Int. J. Cloud Appl. Comput. (IJCAC)"},{"issue":"2","key":"3304_CR3","first-page":"43","volume":"9","author":"K Hossain","year":"2019","unstructured":"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\u201359 (2019)","journal-title":"Int. J. Cloud Appl. Comput. (IJCAC)"},{"issue":"1","key":"3304_CR4","first-page":"93","volume":"11","author":"D Kapgate","year":"2021","unstructured":"Kapgate, D.: Predictive data center selection scheme for response time optimization in cloud computing. Int. J. Cloud Appl. Comput. (IJCAC) 11(1), 93\u2013111 (2021)","journal-title":"Int. J. Cloud Appl. Comput. (IJCAC)"},{"issue":"2","key":"3304_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJCAC.2020040101","volume":"10","author":"M Aliyu","year":"2020","unstructured":"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\u201321 (2020)","journal-title":"International Journal of Cloud Applications and Computing (IJCAC)"},{"issue":"4","key":"3304_CR6","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"issue":"1","key":"3304_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg, M., Rinaldi, G.: Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett. 6(1), 1\u20137 (1987)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"3304_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., et al.: Branch-and-price: COLUMN generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"issue":"11","key":"3304_CR9","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. J. Operat. Res. Soc. 31(11), 1017\u20131023 (1980)","journal-title":"J. Operat. Res. Soc."},{"issue":"2","key":"3304_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"3304_CR11","doi-asserted-by":"crossref","unstructured":"Abdollahzadeh, B., Gharehchopogh F.S.: A multi-objective optimization algorithm for feature selection problems. Eng. Comput. (2021) pp. 1-19.","DOI":"10.1007\/s00366-021-01369-9"},{"issue":"4","key":"3304_CR12","doi-asserted-by":"publisher","first-page":"8747","DOI":"10.1007\/s10586-018-1963-z","volume":"22","author":"Q Meng","year":"2019","unstructured":"Meng, Q., Zhang, J.: Optimization and application of artificial intelligence routing algorithm. Clust. Comput. 22(4), 8747\u20138755 (2019)","journal-title":"Clust. Comput."},{"key":"3304_CR13","doi-asserted-by":"crossref","unstructured":"Gharehchopogh, F.S., Maleki, I., Dizaji, Z.A.: Chaotic vortex search algorithm: metaheuristic algorithm for feature selection. Evol. Intell. (2021) p. 1-32.","DOI":"10.1007\/s12065-021-00590-1"},{"issue":"2","key":"3304_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.3233\/IDA-194485","volume":"24","author":"M Abedi","year":"2020","unstructured":"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\u2013338 (2020)","journal-title":"Intell. Data Anal."},{"issue":"2","key":"3304_CR15","doi-asserted-by":"publisher","first-page":"3011","DOI":"10.1007\/s10586-018-1817-8","volume":"22","author":"Y Cao","year":"2019","unstructured":"Cao, Y., et al.: An improved global best guided artificial bee colony algorithm for continuous optimization problems. Clust. Comput. 22(2), 3011\u20133019 (2019)","journal-title":"Clust. Comput."},{"issue":"2","key":"3304_CR16","doi-asserted-by":"publisher","first-page":"3971","DOI":"10.1007\/s10586-018-2558-4","volume":"22","author":"W Liu","year":"2019","unstructured":"Liu, W., et al.: Improved artificial bee colony algorithm based on self-adaptive random optimization strategy. Clust. Comput. 22(2), 3971\u20133980 (2019)","journal-title":"Clust. Comput."},{"key":"3304_CR17","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.swevo.2018.08.004","volume":"44","author":"SS Choong","year":"2019","unstructured":"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\u2013635 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"3304_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-12286-1_23","volume-title":"Genetic and Evolutionary Computing","author":"JH Drake","year":"2015","unstructured":"Drake, J.H., \u00d6zcan, E., Burke, E.K.: Modified choice function heuristic selection for the multidimensional knapsack problem. In: Genetic and Evolutionary Computing, pp. 225\u2013234. Springer (2015)"},{"key":"3304_CR19","unstructured":"Denzinger, J.r. and M. Fuchs, High performance ATP systems by combining several AI methods. 1996."},{"key":"3304_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., et al.: A classification of hyper-heuristic approaches. In: Handbook of metaheuristics, pp. 449\u2013468. Springer (2010)"},{"issue":"12","key":"3304_CR21","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Operat. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Operat. Res. Soc."},{"key":"3304_CR22","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/3-540-44629-X_11"},{"key":"3304_CR23","doi-asserted-by":"crossref","unstructured":"Drake, J.H., \u00c3\u2013zcan, 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)","DOI":"10.1007\/978-3-642-32964-7_31"},{"key":"3304_CR24","doi-asserted-by":"crossref","unstructured":"Drake, J.H., \u00c3\u2013zcan, 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)","DOI":"10.1109\/CEC.2015.7257315"},{"key":"3304_CR25","doi-asserted-by":"crossref","unstructured":"\u00c3\u2013zcan, 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)","DOI":"10.4018\/978-1-4666-0270-0.ch003"},{"key":"3304_CR26","doi-asserted-by":"crossref","unstructured":"Falc\u00c3\u00a3o, 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)","DOI":"10.1109\/CISTI.2015.7170394"},{"key":"3304_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","volume":"36","author":"J Lin","year":"2017","unstructured":"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\u2013135 (2017)","journal-title":"Swarm Evol. Comput."},{"key":"3304_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-662-47926-1_10","volume-title":"Harmony Search Algorithm","author":"P Dempster","year":"2016","unstructured":"Dempster, P., Drake, J.H.: Two frameworks for cross-domain heuristic and parameter selection using harmony search. In: Harmony Search Algorithm, pp. 83\u201394. Springer (2016)"},{"key":"3304_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.asoc.2016.03.021","volume":"44","author":"KZ Zamli","year":"2016","unstructured":"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\u201374 (2016)","journal-title":"Appl. Soft Comput."},{"key":"3304_CR30","doi-asserted-by":"crossref","unstructured":"Jackson, W.G., \u00c3\u2013zcan, 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)","DOI":"10.1109\/UKCI.2013.6651310"},{"issue":"12","key":"3304_CR31","doi-asserted-by":"publisher","first-page":"2279","DOI":"10.1007\/s00500-013-1096-5","volume":"17","author":"M Kalender","year":"2013","unstructured":"Kalender, M., et al.: A greedy gradient-simulated annealing selection hyper-heuristic. Soft. Comput. 17(12), 2279\u20132292 (2013)","journal-title":"Soft. Comput."},{"key":"3304_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume-title":"Adaptive and multilevel metaheuristics","author":"K Chakhlevitch","year":"2008","unstructured":"Chakhlevitch, K., Cowling, P.: Hyperheuristics: recent developments. In: Adaptive and multilevel metaheuristics, pp. 3\u201329. Springer (2008)"},{"key":"3304_CR33","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari, A.A., et al.: Harris hawks optimization: algorithm and applications. Futur. Gener. Comput. Syst. 97, 849\u2013872 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"3304_CR34","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1016\/j.asoc.2020.106347"},{"key":"3304_CR35","doi-asserted-by":"publisher","first-page":"147596","DOI":"10.1109\/ACCESS.2019.2946664","volume":"7","author":"K Hussain","year":"2019","unstructured":"Hussain, K., Zhu, W., Salleh, M.N.M.: Long-term memory Harris\u00e2\u20acTM hawk optimization for high dimensional and optimal power flow problems. IEEE Access 7, 147596\u2013147616 (2019)","journal-title":"IEEE Access"},{"key":"3304_CR36","first-page":"26","volume":"25","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., et al.: Boosted binary Harris hawks optimizer and feature selection. Structure 25, 26 (2020)","journal-title":"Structure"},{"issue":"1","key":"3304_CR37","first-page":"97","volume":"23","author":"R Hans","year":"2020","unstructured":"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\u2013106 (2020)","journal-title":"J. Interdis. Math."},{"key":"3304_CR38","doi-asserted-by":"crossref","unstructured":"Abdel-Basset, M., Ding, W., El-Shahat, D.: A hybrid Harris Hawks optimization algorithm with simulated annealing for feature selection. Artif. Intell. Rev. 1\u201345 (2020)","DOI":"10.1007\/s10462-020-09860-3"},{"issue":"12","key":"3304_CR39","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.3390\/rs11121421","volume":"11","author":"H Jia","year":"2019","unstructured":"Jia, H., et al.: Dynamic harris hawks optimization with mutation mechanism for satellite image segmentation. Remote Sensing 11(12), 1421 (2019)","journal-title":"Remote Sensing"},{"key":"3304_CR40","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/s00366-019-00892-0"},{"key":"3304_CR41","unstructured":"Reinelt, G.: TSPLIB http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/. (1991)"},{"key":"3304_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2019.03.004","volume":"48","author":"FS Gharehchopogh","year":"2019","unstructured":"Gharehchopogh, F.S., Gholizadeh, H.: A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol. Comput. 48, 1\u201324 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"3304_CR43","doi-asserted-by":"crossref","unstructured":"Gharehchopogh, F.S., Shayanfar, H. Gholizadeh, H.: A comprehensive survey on symbiotic organisms search algorithms. Artif. Intell. Rev. 1-48 (2019)","DOI":"10.1007\/s10462-019-09733-4"},{"issue":"5","key":"3304_CR44","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"S G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc, 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\u20131685 (2018)","journal-title":"Soft. Comput."},{"key":"3304_CR45","doi-asserted-by":"crossref","unstructured":"Ezugwu, A.E.-S., A.O. Adewumi, and M.E. Fr\u00c3\u00aencu, Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Systems with Applications, 2017. 77: p. 189-210.","DOI":"10.1016\/j.eswa.2017.01.053"},{"key":"3304_CR46","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong, Y., et al.: Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol. Comput. 42, 77\u201388 (2018)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"3304_CR47","first-page":"1","volume":"18","author":"Y Sun","year":"2019","unstructured":"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\u201311 (2019)","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"3304_CR48","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.swevo.2019.04.002","volume":"48","author":"Y Zhong","year":"2019","unstructured":"Zhong, Y., et al.: Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem. Swarm Evol. Comput. 48, 134\u2013144 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"3304_CR49","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12204-019-2039-9","volume":"24","author":"R Dong","year":"2019","unstructured":"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\u201347 (2019)","journal-title":"J. Shanghai Jiaotong Univ. (Science)"},{"issue":"1","key":"3304_CR50","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s12065-018-0169-x","volume":"12","author":"MF Pook","year":"2019","unstructured":"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\u201320 (2019)","journal-title":"Evol. Intel."},{"key":"3304_CR51","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cie.2019.04.008","volume":"131","author":"Y Wang","year":"2019","unstructured":"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\u2013281 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"3304_CR52","doi-asserted-by":"publisher","first-page":"3669","DOI":"10.1007\/s13369-018-3617-0","volume":"44","author":"MA Tawhid","year":"2019","unstructured":"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\u20133679 (2019)","journal-title":"Arab. J. Sci. Eng."},{"issue":"01","key":"3304_CR53","doi-asserted-by":"publisher","first-page":"1950004","DOI":"10.1142\/S0218213019500040","volume":"28","author":"D Karaboga","year":"2019","unstructured":"Karaboga, D., Gorkemli, B.: Solving traveling salesman problem by using combinatorial artificial bee colony algorithms. Int. J. Artif. Intell. Tools 28(01), 1950004 (2019)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"2","key":"3304_CR54","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s12065-019-00208-7","volume":"12","author":"SK Sahana","year":"2019","unstructured":"Sahana, S.K.: Hybrid optimizer for the travelling salesman problem. Evol. Intel. 12(2), 179\u2013188 (2019)","journal-title":"Evol. Intel."},{"key":"3304_CR55","doi-asserted-by":"publisher","first-page":"112867","DOI":"10.1016\/j.eswa.2019.112867","volume":"139","author":"C Jiang","year":"2020","unstructured":"Jiang, C., Wan, Z., Peng, Z.: A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst. Appl. 139, 112867 (2020)","journal-title":"Expert Syst. Appl."},{"key":"3304_CR56","doi-asserted-by":"publisher","first-page":"100607","DOI":"10.1016\/j.swevo.2019.100607","volume":"52","author":"IM Ali","year":"2020","unstructured":"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)","journal-title":"Swarm Evol. Comput."},{"key":"3304_CR57","doi-asserted-by":"publisher","first-page":"103649","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad, S.: DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Eng. Appl. Artif. Intell. 92, 103649 (2020)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"3304_CR58","first-page":"879","volume":"23","author":"AC Cinar","year":"2020","unstructured":"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\u2013890 (2020)","journal-title":"Eng. Sci. Technol. Int. J."},{"key":"3304_CR59","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-981-15-0222-4_12","volume-title":"Advances in Computing and Intelligent Systems","author":"T George","year":"2020","unstructured":"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\u2013151. Springer (2020)"},{"key":"3304_CR60","doi-asserted-by":"crossref","unstructured":"Yousefikhoshbakht, M., Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm. Complexity, 2021. 2021.","DOI":"10.1155\/2021\/6668345"},{"key":"3304_CR61","doi-asserted-by":"publisher","first-page":"107085","DOI":"10.1016\/j.asoc.2021.107085","volume":"102","author":"Y Huang","year":"2021","unstructured":"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)","journal-title":"Appl. Soft Comput."},{"key":"3304_CR62","doi-asserted-by":"publisher","first-page":"104006","DOI":"10.1016\/j.engappai.2020.104006","volume":"97","author":"GH Al-Gaphari","year":"2021","unstructured":"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)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"3304_CR63","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1002\/int.22342","volume":"36","author":"A Benyamin","year":"2021","unstructured":"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\u20131303 (2021)","journal-title":"Int. J. Intell. Syst."},{"issue":"2","key":"3304_CR64","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"3304_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","volume":"27","author":"S Das","year":"2016","unstructured":"Das, S., Mullick, S.S., Suganthan, P.N.: Recent advances in differential evolution\u00e2\u20ac\u201can updated survey. Swarm Evol. Comput. 27, 1\u201330 (2016)","journal-title":"Swarm Evol. Comput."},{"key":"3304_CR66","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.knosys.2019.01.023","volume":"169","author":"M Abd Elaziz","year":"2019","unstructured":"Abd Elaziz, M., et al.: Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution. Knowl.-Based Syst. 169, 39\u201352 (2019)","journal-title":"Knowl.-Based Syst."},{"key":"3304_CR67","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.asoc.2017.04.018","volume":"58","author":"SS Jadon","year":"2017","unstructured":"Jadon, S.S., et al.: Hybrid artificial bee colony algorithm with differential evolution. Appl. Soft Comput. 58, 11\u201324 (2017)","journal-title":"Appl. Soft Comput."},{"key":"3304_CR68","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.solener.2018.10.050","volume":"176","author":"G Xiong","year":"2018","unstructured":"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\u2013761 (2018)","journal-title":"Sol. Energy"},{"issue":"12","key":"3304_CR69","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q-K Pan","year":"2011","unstructured":"Pan, Q.-K., et al.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12), 2455\u20132468 (2011)","journal-title":"Inf. Sci."},{"issue":"1","key":"3304_CR70","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"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\u2013135 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"3304_CR71","doi-asserted-by":"crossref","unstructured":"Liu, X., Su, J., Han, Y.: An improved particle swarm optimization for traveling salesman problem. In International Conference on Intelligent Computing. Springer, (2007)","DOI":"10.1007\/978-3-540-74205-0_84"},{"key":"3304_CR72","unstructured":"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)"},{"issue":"8","key":"3304_CR73","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S Irnich","year":"2006","unstructured":"Irnich, S., Funke, B., Gr\u00c3nert, T.: Sequential search and its application to vehicle-routing problems. Comp. Operat. Res. 33(8), 2405\u20132429 (2006)","journal-title":"Comp. Operat. Res."},{"issue":"4","key":"3304_CR74","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D Sha","year":"2006","unstructured":"Sha, D., Hsu, C.-Y.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791\u2013808 (2006)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"3304_CR75","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00521-011-0794-0","volume":"23","author":"MS K\u00c4ran","year":"2013","unstructured":"K\u00c4ran, M.S., \u00c4\u00c5\u0178can, H.M., G\u00c3nd\u00c3z, M.: The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem. Neural Comput. Appl. 23(1), 9\u201321 (2013)","journal-title":"Neural Comput. Appl."},{"key":"3304_CR76","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/3-540-44629-X_11"},{"issue":"6","key":"3304_CR77","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"10","key":"3304_CR78","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"3304_CR79","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"3304_CR80","doi-asserted-by":"crossref","unstructured":"Mart\u00c3\u00ad, R., et al.: Multi-start methods. Handbook of Heuristics, p. 1-21 (2016)","DOI":"10.1007\/978-3-319-07153-4_1-1"},{"key":"3304_CR81","doi-asserted-by":"crossref","unstructured":"Li, W.: A parallel multi-start search algorithm for dynamic traveling salesman problem. In International Symposium on Experimental Algorithms. Springer, (2011)","DOI":"10.1007\/978-3-642-20662-7_6"},{"key":"3304_CR82","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cor.2017.02.004","volume":"83","author":"M Avci","year":"2017","unstructured":"Avci, M., Topaloglu, S.: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem. Comput. Oper. Res. 83, 54\u201365 (2017)","journal-title":"Comput. Oper. Res."},{"key":"3304_CR83","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.cor.2013.07.025","volume":"41","author":"J Michallet","year":"2014","unstructured":"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\u2013207 (2014)","journal-title":"Comput. Oper. Res."},{"key":"3304_CR84","doi-asserted-by":"crossref","unstructured":"Louren\u00c3o, H.R., Martin, O.C., St\u00c3tzle, T.: Iterated local search: Framework and applications, In Handbook of metaheuristics. Springer. p. 129-168 (2019)","DOI":"10.1007\/978-3-319-91086-4_5"},{"issue":"1","key":"3304_CR85","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"key":"3304_CR86","unstructured":"Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Citeseer, (1991)"},{"issue":"21","key":"3304_CR87","doi-asserted-by":"publisher","first-page":"6288","DOI":"10.1080\/00207543.2017.1341065","volume":"55","author":"R Kramer","year":"2017","unstructured":"Kramer, R., Dell\u2019Amico, 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\u20136304 (2017)","journal-title":"Int. J. Product. Res."},{"issue":"9","key":"3304_CR88","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1080\/00207543.2014.883472","volume":"52","author":"A Subramanian","year":"2014","unstructured":"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\u20132742 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"3304_CR89","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.cie.2015.04.030","volume":"87","author":"X Dong","year":"2015","unstructured":"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\u2013185 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"3304_CR90","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCYB.2014.2317488","volume":"45","author":"S Nguyen","year":"2014","unstructured":"Nguyen, S., et al.: Automatic programming via iterated local search for dynamic job shop scheduling. IEEE Trans. Cybernet. 45(1), 1\u201314 (2014)","journal-title":"IEEE Trans. Cybernet."},{"issue":"7","key":"3304_CR91","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1016\/j.eswa.2014.12.004","volume":"42","author":"J Li","year":"2015","unstructured":"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\u20133561 (2015)","journal-title":"Expert Syst. Appl."},{"key":"3304_CR92","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2014.08.005","volume":"53","author":"MM Silva","year":"2015","unstructured":"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\u2013249 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"3304_CR93","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1590\/0101-7438.2015.035.03.0465","volume":"35","author":"BALDM Herrera","year":"2015","unstructured":"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\u2013488 (2015)","journal-title":"Pesquisa Operacional"},{"key":"3304_CR94","first-page":"171","volume":"1","author":"F Wilcoxon","year":"1970","unstructured":"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\u2013259 (1970)","journal-title":"Select. Tables Math. Statist."},{"key":"3304_CR95","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","volume":"421","author":"Y Zhong","year":"2017","unstructured":"Zhong, Y., et al.: Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf. Sci. 421, 70\u201384 (2017)","journal-title":"Inf. Sci."},{"key":"3304_CR96","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/978-3-642-04898-2_616","volume-title":"International encyclopedia of statistical science","author":"D Rey","year":"2011","unstructured":"Rey, D., Neuh\u00e4user, M.: Wilcoxon-signed-rank test. In: International encyclopedia of statistical science, pp. 1658\u20131659. Springer, Berlin, Heidelberg (2011)"},{"key":"3304_CR97","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.neucom.2017.02.041","volume":"240","author":"H Wang","year":"2017","unstructured":"Wang, H., Zhang, N., Cr\u00c3put, J.-C.: A massively parallel neural network approach to large-scale Euclidean traveling salesman problems. Neurocomputing 240, 137\u2013151 (2017)","journal-title":"Neurocomputing"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03304-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-021-03304-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03304-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T20:06:46Z","timestamp":1652818006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-021-03304-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,31]]},"references-count":97,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["3304"],"URL":"https:\/\/doi.org\/10.1007\/s10586-021-03304-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,31]]},"assertion":[{"value":"16 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}