{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T06:29:25Z","timestamp":1769149765952,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s12065-020-00389-6","type":"journal-article","created":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T09:02:29Z","timestamp":1587200549000},"page":"741-764","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An enhanced Moth-flame optimization algorithm for permutation-based problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Ahmed","family":"Helmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Alenany","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"key":"389_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"E Talbi","year":"2009","unstructured":"Talbi E (2009) Metaheuristics: from design to implementation. Wiley Publishing, Hoboken"},{"key":"389_CR2","doi-asserted-by":"crossref","unstructured":"P\u00f3rez C\u00e1ceres L, L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2014) Ant colony optimization on a budget of 1000. In: Dorigo M et al. (Eds.), Swarm Intell ANTS 2014. Lecture Notes in Computer Science, vol 8667:50\u201361. Springer","DOI":"10.1007\/978-3-319-09952-1_5"},{"key":"389_CR3","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"389_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-07124-4","volume-title":"Handbook of heuristics","author":"R Marti","year":"2018","unstructured":"Marti R, Pardalos PM, Resende MGC (2018) Handbook of heuristics. Springer, Berlin"},{"key":"389_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-0-387-30165-5_4","volume-title":"Handbook of optimization in telecommunications","author":"SL Martins","year":"2006","unstructured":"Martins SL, Ribeiro C (2006) Metaheuristics and applications to optimization problems in telecommunications. In: Resende M, Pardalos P (eds) Handbook of optimization in telecommunications. Springer, Berlin, pp 103\u2013128"},{"key":"389_CR6","first-page":"2191","volume":"54","author":"K Hussain","year":"2018","unstructured":"Hussain K, Salleh M, Cheng S, Shi Y (2018) Metaheuristic research: a comprehensive survey. Artif Intell Rev 54:2191\u20132233","journal-title":"Artif Intell Rev"},{"issue":"1","key":"389_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3054133","volume":"50","author":"A Soler-Dominguez","year":"2017","unstructured":"Soler-Dominguez A, Juan AA, Kizys R (2017) A survey on financial applications of metaheuristics. ACM Comput Surv 50(1):1\u201323","journal-title":"ACM Comput Surv"},{"key":"389_CR8","first-page":"1","volume":"5","author":"Z Beheshti","year":"2013","unstructured":"Beheshti Z, Shamsuddin SM (2013) A review of population-based meta-heuristic algorithm. Int J Adv Soft Comput Appl 5:1\u201335","journal-title":"Int J Adv Soft Comput Appl"},{"key":"389_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge"},{"key":"389_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11047-007-9050-z","volume":"7","author":"A Banks","year":"2008","unstructured":"Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. Part ii: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7:109\u2013124","journal-title":"Nat Comput"},{"key":"389_CR11","doi-asserted-by":"crossref","unstructured":"Lampinen J, Storn R (2004) Differential evolution. In: New optimization techniques in engineering. Studies in Fuzziness and Soft Computing, vol 141. Springer, Berlin","DOI":"10.1007\/978-3-540-39930-8_6"},{"key":"389_CR12","unstructured":"Yang X-S, Deb S (2009). Cuckoo search via L\u00e9vy flights. World congress on nature & biologically inspired computing (NaBIC 2009). IEEE Publications, pp 210\u2013214. arXiv:1003.1594v1"},{"key":"389_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42:21\u201357","journal-title":"Artif Intell Rev"},{"key":"389_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-93073-2","volume-title":"An introduction to metaheuristics for optimization","author":"B Chopard","year":"2018","unstructured":"Chopard B, Tomassini M (2018) An introduction to metaheuristics for optimization. Springer, Berlin"},{"key":"389_CR15","doi-asserted-by":"crossref","unstructured":"Mehdi M (2011) Parallel hybrid optimization methods for permutation-based problems. Ph.D. thesis, University of Science and Technology of Lille I","DOI":"10.1109\/CEC.2010.5586526"},{"key":"389_CR16","first-page":"1","volume-title":"The traveling salesman problem, and its variations","author":"AP Punnen","year":"2007","unstructured":"Punnen AP (2007) The traveling salesman problem: applications, formulations and variations. In: Gutin G, Punnen AP (eds) The traveling salesman problem, and its variations. Springer, Berlin, pp 1\u201328"},{"key":"389_CR17","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves JF, Resende MG (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17:487\u2013525","journal-title":"J Heuristics"},{"key":"389_CR18","first-page":"1024","volume":"2015","author":"Y Deng","year":"2015","unstructured":"Deng Y, Liu Y, Zhou Y (2015) An improved genetic algorithm with initial population strategy for symmetric TSP. Math Prob Eng 2015:1024\u2013123X","journal-title":"Math Prob Eng"},{"key":"389_CR19","doi-asserted-by":"crossref","unstructured":"Hoffmann M, M\u00fchlenthaler M, Helwig S, Wanka R, (2011) Discrete particle swarm optimization for TSP: theoretical results and experimental evaluations. In: Bouchachia A eds) Adaptive and intelligent systems. ICAIS, Lecture Notes in Computer Science, vol 6943. Springer, Berlin","DOI":"10.1007\/978-3-642-23857-4_40"},{"key":"389_CR20","doi-asserted-by":"crossref","unstructured":"Mi M, Huifeng X, Ming Z, Yu G (2010) An improved differential evolution algorithm for TSP problem. In: International conference on intelligent computation technology and automation, Changsha, pp 544\u2013547","DOI":"10.1109\/ICICTA.2010.461"},{"issue":"4","key":"389_CR21","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1007\/s00500-014-1322-9","volume":"19","author":"A Ouaarab","year":"2015","unstructured":"Ouaarab A, Ahiod B, Yang X-S (2015) Random-key cuckoo search for the travelling salesman problem. Soft Comput 19(4):1432\u20137643","journal-title":"Soft Comput"},{"key":"389_CR22","doi-asserted-by":"crossref","unstructured":"Li L, Cheng Y, Tan L, Niu B, (2012) A discrete artificial bee colony algorithm for TSP problem. In: Huang DS, Gan Y, Premaratne P, Han K (eds) Bio-inspired computing and applications. ICIC, Lecture Notes in Computer Science, vol 6840. Springer, Berlin","DOI":"10.1007\/978-3-642-24553-4_75"},{"key":"389_CR23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344:243\u2013278","journal-title":"Theor Comput Sci"},{"key":"389_CR24","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1109\/JSEE.2015.00142","volume":"26","author":"M Li","year":"2015","unstructured":"Li M (2015) Efficiency improvement of ant colony optimization in solving the moderate LTSP. J. Syst Eng Electron 26:1300\u20131308","journal-title":"J. Syst Eng Electron"},{"key":"389_CR25","doi-asserted-by":"crossref","unstructured":"Eskandari L, Jafarian A, Rahimloo P, Baleanu D (2019) A modified and enhanced ant colony optimization algorithm for traveling salesman problem. In: Ta\u015f K, Baleanu D, Machado J (eds) Mathematical methods in engineering. Nonlinear Systems and Complexity, vol 23. Springer, Berlin","DOI":"10.1007\/978-3-319-91065-9_13"},{"issue":"7","key":"389_CR26","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Martins M\u00fcller F, Yang S (2017) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern 47(7):1743\u20131756","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"389_CR27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43(2):73\u201381","journal-title":"Biosystems"},{"key":"389_CR28","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.egypro.2012.02.101","volume":"17","author":"K Jun-man","year":"2012","unstructured":"Jun-man K, Yi Z (2012) Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Proc 17:319\u2013325","journal-title":"Energy Proc"},{"key":"389_CR29","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl Based Syst 89:228\u2013249","journal-title":"Knowl Based Syst"},{"key":"389_CR30","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s12065-019-00257-y","volume":"12","author":"R Barham","year":"2019","unstructured":"Barham R, Sharieh A, Sleit A (2019) Multi-Moth flame optimization for solving the link prediction problem in complex networks. Evol Intell 12:563\u2013591","journal-title":"Evol Intell"},{"key":"389_CR31","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.enconman.2016.06.052","volume":"123","author":"D Allam","year":"2016","unstructured":"Allam D, Yousri DA, Eteiba MB (2016) Parameters extraction of the three diode model for the multi-crystalline solar cell\/module using Moth-flame optimization algorithm. Energy Convers Manag 123:535\u2013548","journal-title":"Energy Convers Manag"},{"issue":"3","key":"389_CR32","doi-asserted-by":"crossref","first-page":"e2743","DOI":"10.1002\/etep.2743","volume":"29","author":"MA Taher","year":"2018","unstructured":"Taher MA, Kamel S, Jurado F, Ebeed M (2018) An improved moth-flame optimization algorithm for solving optimal power flow problem. Int Trans Electr Energy Syst 29(3):e2743","journal-title":"Int Trans Electr Energy Syst"},{"key":"389_CR33","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.knosys.2019.02.011","volume":"172","author":"X Lei","year":"2019","unstructured":"Lei X, Fang M, Fujita H (2019) Moth-flame optimization-based algorithm with synthetic dynamic PPI networks for discovering protein complexes. Knowl Based Syst 172:76\u201385","journal-title":"Knowl Based Syst"},{"key":"389_CR34","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.21817\/ijet\/2018\/v10i6\/181006091","volume":"10","author":"H AbdElhamid","year":"2019","unstructured":"AbdElhamid H, Helmi A, Ziedan I (2019) LCMFO: an improved moth-flame algorithm for combinatorial optimization problems. Int J Eng Techol 10:1793\u20131800","journal-title":"Int J Eng Techol"},{"issue":"4","key":"389_CR35","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s42235-018-0063-3","volume":"15","author":"L Xu","year":"2018","unstructured":"Xu L, Li Y, Li K, Beng G, Jiang Z, Wang C, Liu N (2018) Enhanced moth-flame optimization based on cultural learning and Gaussian mutation. J Bionic Eng 15(4):751\u2013763","journal-title":"J Bionic Eng"},{"key":"389_CR36","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.neucom.2017.04.060","volume":"267","author":"M Wang","year":"2017","unstructured":"Wang M, Chen H, Yang B, Zhao X, Hu L, Cai Z, Huang H, Tong C (2017) Toward an optimal kernel extreme learning machine using a chaotic moth-flame optimization strategy with applications in medical diagnoses. Neurocomputing 267:69\u201384","journal-title":"Neurocomputing"},{"key":"389_CR37","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.eswa.2019.03.043","volume":"129","author":"Y Xu","year":"2019","unstructured":"Xu Y, Chen H, Heidari AA, Luo J, Zhang Q, Zhao X, Li C (2019) An efficient chaotic mutative moth-flame-inspired optimizer for global optimization tasks. Expert Syst Appl 129:135\u2013155","journal-title":"Expert Syst Appl"},{"key":"389_CR38","first-page":"1","volume":"2016","author":"Z Li","year":"2016","unstructured":"Li Z, Zhou Y, Zhang S, Song J (2016) L\u00e9vy-flight Moth-flame algorithm for function optimization and engineering design problems. Math Probl Eng 2016:1\u201322","journal-title":"Math Probl Eng"},{"key":"389_CR39","doi-asserted-by":"crossref","first-page":"6023","DOI":"10.1007\/s00500-018-3586-y","volume":"23","author":"S Sapre","year":"2019","unstructured":"Sapre S, Mini S (2019) Opposition-based moth flame optimization with Cauchy mutation and evolutionary boundary constraint handling for global optimization. Soft Comput 23:6023\u20136041","journal-title":"Soft Comput"},{"key":"389_CR40","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.ins.2019.04.022","volume":"492","author":"Y Xu","year":"2019","unstructured":"Xu Y, Chen H, Luo J, Zhang Q, Jiao S, Zhang X (2019) Enhanced moth-flame optimizer with mutation strategy for global optimization. Inf Sci 492:181\u2013203","journal-title":"Inf Sci"},{"key":"389_CR41","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.engappai.2017.04.018","volume":"63","author":"V Savsani","year":"2017","unstructured":"Savsani V, Tawhid MA (2017) Non-dominated sorting moth flame optimization (NS-MFO) for multi-objective problems. Eng Appl Artif Intell 63:20\u201332","journal-title":"Eng Appl Artif Intell"},{"issue":"5","key":"389_CR42","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1007\/s00500-017-2894-y","volume":"23","author":"S Khalilpourazari","year":"2017","unstructured":"Khalilpourazari S, Khalilpourazary S (2017) An efficient hybrid algorithm based on water cycle and moth-flame optimization algorithms for solving numerical and constrained engineering optimization problems. Soft Comput 23(5):1699\u20131722","journal-title":"Soft Comput"},{"key":"389_CR43","doi-asserted-by":"crossref","first-page":"76700","DOI":"10.1109\/ACCESS.2018.2884130","volume":"6","author":"C Li","year":"2018","unstructured":"Li C, Niu Z, Song Z, Li B, Fan J, Liu PX (2018) A double evolutionary learning moth-flame optimization for real-parameter global optimization problems. IEEE Access 6:76700\u201376727","journal-title":"IEEE Access"},{"key":"389_CR44","first-page":"65","volume":"10","author":"M Shehab","year":"2019","unstructured":"Shehab M, Abualigah L, Al Hamad H (2019) Moth-flame optimization algorithm: variants and applications. Neural Comput Appl 10:65","journal-title":"Neural Comput Appl"},{"key":"389_CR45","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized travelling salesman problem. Eur J Oper Res 174:38\u201353","journal-title":"Eur J Oper Res"},{"key":"389_CR46","unstructured":"Reinelt G, TSPLIB Datasets. http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html. Accessed 04 Apr 2019"},{"key":"389_CR47","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/9783527622979.ch5","volume-title":"Anomalous transport, chapter 5","author":"AV Chechkin","year":"2008","unstructured":"Chechkin AV, Metzler R, Klafter J, Gonchar V (2008) Introduction to the theory of L\u00e9vy flights. In: Klage H, Radons G, Sokolov IM (eds) Anomalous transport, chapter 5. Wiley, Hoboken, pp 129\u2013162"},{"issue":"3","key":"389_CR48","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1017\/S0140525X0003123X","volume":"16","author":"M Tomasello","year":"1993","unstructured":"Tomasello M, Kruger AC, Ratner HH (1993) Cultural learning. Behav Brain Sci 16(3):495\u2013511","journal-title":"Behav Brain Sci"},{"key":"389_CR49","doi-asserted-by":"crossref","first-page":"136","DOI":"10.2174\/1874431101004010136","volume":"4","author":"A Candelieri","year":"2010","unstructured":"Candelieri A, Conforti D (2010) A hyper-solution framework for SVM classification: application for predicting destabilizations in chronic heart failure patients. Open Med Inf J 4:136\u2013140","journal-title":"Open Med Inf J"},{"key":"389_CR50","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Molina D, Lozano D, Herrera F (2008) A study on the use of nonparametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"},{"issue":"4","key":"389_CR51","doi-asserted-by":"crossref","first-page":"867","DOI":"10.2478\/v10006-012-0064-z","volume":"22","author":"B Trawinski","year":"2012","unstructured":"Trawinski B, Smetek M, Telec Z, Lasota T (2012) Nonparametric statistical analysis for multiple comparison of machine learning regression algorithms. Int J Appl Math Comput Sci 22(4):867\u2013881","journal-title":"Int J Appl Math Comput Sci"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00389-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00389-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00389-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:07:15Z","timestamp":1618704435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00389-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,18]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["389"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00389-6","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,18]]},"assertion":[{"value":"23 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}