{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:59:37Z","timestamp":1758401977313,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61562071","61773410"],"award-info":[{"award-number":["61562071","61773410"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Humanities and Social Sciences Research Foundation of the Ministry of Education of China","award":["21YJAZH065"],"award-info":[{"award-number":["21YJAZH065"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00521-023-08388-1","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T05:02:49Z","timestamp":1679547769000},"page":"14153-14167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Runtime analysis of some hybrid algorithms"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2849-4298","authenticated-orcid":false,"given":"Xinsheng","family":"Lai","sequence":"first","affiliation":[]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"issue":"2","key":"8388_CR1","first-page":"159","volume":"32","author":"BH Abed-alguni","year":"2020","unstructured":"Abed-alguni BH, Alkhateeb F (2020) Intelligent hybrid cuckoo search and $$\\beta $$-hill climbing algorithm. J King Saud Univ Comput Inf Sci 32(2):159\u2013173","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"8388_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/562194","volume":"3","author":"S Aghabozorgi","year":"2014","unstructured":"Aghabozorgi S, Wah TY, Herawan T, Jalab HA, Shaygan MA, Jalali A (2014) A hybrid algorithm for clustering of time series data based on affinity search technique. Scient World J 3:1\u201312","journal-title":"Scient World J"},{"key":"8388_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste S, Jansen T, Wegener I (2002) On the analysis of the (1+1) evolutionary algorithm. Theoret Comput Sci 276:51\u201381","journal-title":"Theoret Comput Sci"},{"issue":"6","key":"8388_CR4","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1080\/18756891.2016.1256577","volume":"9","author":"Y Feng","year":"2016","unstructured":"Feng Y, Wang G-G, Gao X-Z (2016) A novel hybrid cuckoo search algorithm with global harmony search for 0\u20131 knapsack problems. Int J Computat Intell Syst 9(6):1174\u20131190","journal-title":"Int J Computat Intell Syst"},{"issue":"1","key":"8388_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco.2009.17.1.3","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich T, He J, Hebbinghaus N, Neumann F, Witt C (2009) Analyses of simple hybrid algorithms for the vertex cover problem. Evol Computat 17(1):3\u201319","journal-title":"Evol Computat"},{"issue":"4","key":"8388_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich T, He J, Hebbinghaus N, Neumann F, Witt C (2010) Approximating covering problems by randomized search heuristics using multi-objective models. Evol Computat 18(4):617\u2013633","journal-title":"Evol Computat"},{"issue":"1","key":"8388_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/0217002","volume":"17","author":"DK Friesen","year":"1988","unstructured":"Friesen DK, Kuhl FS (1988) Analysis of a hybrid algorithm for packing unequal bins. SIAM J Comput 17(1):23\u201340","journal-title":"SIAM J Comput"},{"key":"8388_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-28493-9_11","volume-title":"Asian conference on intelligent information and database systems","author":"A Ghodrati","year":"2012","unstructured":"Ghodrati A, Lotfi S (2012) A hybrid CS\/PSO algorithm for global optimization. Asian conference on intelligent information and database systems. Springer, London, pp 89\u201398"},{"issue":"1","key":"8388_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J He","year":"2004","unstructured":"He J, Yao X (2004) A study of drift analysis for estimating computation time of evolutionary algorithms. Nat Comput 3(1):21\u201335","journal-title":"Nat Comput"},{"issue":"1","key":"8388_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"key":"8388_CR11","first-page":"1","volume":"2008","author":"N Holden","year":"2008","unstructured":"Holden N, Freitas AA (2008) A hybrid PSO\/ACO algorithm for discovering classification rules in data mining. J Artif Evol Appl 2008:1\u201311","journal-title":"J Artif Evol Appl"},{"issue":"6","key":"8388_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.tcs.2010.09.027","volume":"412","author":"T Jansen","year":"2011","unstructured":"Jansen T, Zarges C (2011) Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoret Comput Sci 412(6):517\u2013533","journal-title":"Theoret Comput Sci"},{"issue":"5","key":"8388_CR13","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TEVC.2011.2150754","volume":"15","author":"J-Y Lin","year":"2011","unstructured":"Lin J-Y, Chen Y-P (2011) Analysis on the collaboration between global search and local search in memetic computation. IEEE Trans Evol Computat 15(5):608\u2013623","journal-title":"IEEE Trans Evol Computat"},{"key":"8388_CR14","doi-asserted-by":"crossref","unstructured":"Liu W, Weise T, Wu Y, Qi Q (2017) Combining two local searches with crossover: an efficient hybrid algorithm for the traveling salesman problem. In: 2017 Genetic and evolutionary computation conference (GECCO\u201917). ACM, pp 298\u2013305","DOI":"10.1145\/3071178.3071201"},{"key":"8388_CR15","volume-title":"A hybrid algorithm technique","author":"M Malek","year":"1989","unstructured":"Malek M, Guruswamy M, Owens H, Pandya M (1989) A hybrid algorithm technique. The university of texas at austin, Department of Computer Sciences Technical Report"},{"issue":"A","key":"8388_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.neucom.2014.02.074","volume":"150","author":"O Matei","year":"2015","unstructured":"Matei O, Pop PC, Sas JL, Chira C (2015) An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem. Neurocomputing 150(A):58\u201366","journal-title":"Neurocomputing"},{"key":"8388_CR17","unstructured":"Mirjalili S, Hashim SZM (2012) A new hybrid PSOGSA algorithm for function optimization. In: 2012 international conference on computer and information application. IEEE, pp 374-377"},{"issue":"6","key":"8388_CR18","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1007\/s00521-014-1629-6","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Wang G-G, Coelho LDS (2014) Binary optimization using hybrid particle swarm optimization and gravitational search algorithm. Neural Comput Appl 25(6):1423\u20131435","journal-title":"Neural Comput Appl"},{"key":"8388_CR19","doi-asserted-by":"crossref","unstructured":"Neumann F, Sudholt D, Witt C (2008) Rigorous analyses for the combination of ant colony optimization and local search. In: 2008 international conference on ant colony optimization and swarm intelligence (ANTS 2008). Springer, pp 132-143","DOI":"10.1007\/978-3-540-87527-7_12"},{"key":"8388_CR20","doi-asserted-by":"crossref","unstructured":"Neumann F, Sudholt D, Witt C (2009) Computational complexity of ant colony optimization and its hybridization with local search. In 2009 innovations in swarm intelligence, ser. studies on computational intelligence. Springer, pp 91-120","DOI":"10.1007\/978-3-642-04225-6_6"},{"key":"8388_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired computation in combinatorial optimization: algorithms and their computational complexity","author":"F Neumann","year":"2010","unstructured":"Neumann F, Witt C (2010) Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. Springer, Berlin"},{"issue":"1","key":"8388_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103345","volume":"287","author":"PTH Nguyen","year":"2020","unstructured":"Nguyen PTH, Sudholt D (2020) Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif Intell 287(1):103345","journal-title":"Artif Intell"},{"issue":"22","key":"8388_CR23","doi-asserted-by":"publisher","first-page":"9191","DOI":"10.1016\/j.apm.2013.03.075","volume":"37","author":"PC Pop","year":"2013","unstructured":"Pop PC, Matei O (2013) A memetic algorithm for solving the multidimensional multi-way number partitioning problem. Appl Math Modell 37(22):9191\u20139202","journal-title":"Appl Math Modell"},{"key":"8388_CR24","doi-asserted-by":"crossref","unstructured":"Puchinger J, Raidl G (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: Proceedings of the first international work-conference on the interplay between natural and artificial computation conference on artificial intelligence. Springer, pp 41-53","DOI":"10.1007\/11499305_5"},{"key":"8388_CR25","doi-asserted-by":"crossref","unstructured":"Sudholt D (2006) On the analysis of the (1+1) memetic algorithm. In: 2006 conference on Genetic and evolutionary computation (GECCO\u201906). ACM, pp 493-500","DOI":"10.1145\/1143997.1144087"},{"issue":"26","key":"8388_CR26","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.1016\/j.tcs.2009.03.003","volume":"410","author":"D Sudholt","year":"2009","unstructured":"Sudholt D (2009) The impact of parametrization in memetic evolutionary algorithms. Theoret Comput Sci 410(26):2511\u20132528","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"8388_CR27","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00453-009-9384-2","volume":"59","author":"D Sudholt","year":"2011","unstructured":"Sudholt D (2011) Hybridizing evolutionary algorithms with variable-depth search to overcome local optima. Algorithmica 59(3):343\u2013368","journal-title":"Algorithmica"},{"issue":"1","key":"8388_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00500-014-1502-7","volume":"20","author":"G-G Wang","year":"2016","unstructured":"Wang G-G, Gandomi AH, Zhao X, Chu HCE (2016) Hybridizing harmony search algorithm with cuckoo search for global numerical optimization. Soft Comput 20(1):273\u2013285","journal-title":"Soft Comput"},{"issue":"4","key":"8388_CR29","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00521-015-1914-z","volume":"27","author":"G-G Wang","year":"2016","unstructured":"Wang G-G, Gandomi AH, Alavi AH, Deb S (2016) A hybrid method based on krill herd and quantum-behaved particle swarm optimization. Neural Comput Appl 27(4):989\u20131006","journal-title":"Neural Comput Appl"},{"key":"8388_CR30","doi-asserted-by":"crossref","unstructured":"Wei K, Dinneen MJ (2014) Runtime analysis to compare best-improvement and first-improvement in memetic algorithms. In: 2014 genetic and evolutionary computation conference (GECCO\u201914). ACM, pp 1439-1446","DOI":"10.1145\/2576768.2598386"},{"key":"8388_CR31","doi-asserted-by":"crossref","unstructured":"Wei K, Dinneen MJ (2014) Hybridizing the dynamic mutation approach with local searches to overcome local optima. In: 2014 IEEE Congress on Evolutionary Computation (CEC 2014) IEEE. pp 74-81","DOI":"10.1109\/CEC.2014.6900360"},{"key":"8388_CR32","doi-asserted-by":"crossref","unstructured":"Wei K, Dinneen MJ (2014) Runtime analysis comparison of two fitness functions on a memetic algorithm for the clique problem. In: 2014 IEEE congress on evolutionary computation (CEC 2014) IEEE, pp 133-140","DOI":"10.1109\/CEC.2014.6900359"},{"key":"8388_CR33","doi-asserted-by":"crossref","unstructured":"Wu Y, Weise T, Liu W (2016) Hybridizing different local search algorithms with each other and evolutionary computation: better performance on the traveling salesman problem. In: 2016 genetic and evolutionary computation conference (GECCO\u201916). ACM, pp 57-58","DOI":"10.1145\/2908961.2909001"},{"key":"8388_CR34","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ins.2017.10.038","volume":"426","author":"X Xia","year":"2017","unstructured":"Xia X, Zhou Y (2017) On the effectiveness of immune inspired mutation operators in some discrete optimization problems. Inf Sci 426:87\u2013100","journal-title":"Inf Sci"},{"issue":"3","key":"8388_CR35","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1109\/TCBB.2015.2465957","volume":"13","author":"J Xie","year":"2016","unstructured":"Xie J, Xiang C, Ma J, Tan J, Wen T, Lei J, Nie Q (2016) An adaptive hybrid algorithm for global network alignment. IEEE\/ACM Trans Computat Biol Bioinformat 13(3):483\u2013493","journal-title":"IEEE\/ACM Trans Computat Biol Bioinformat"},{"issue":"1","key":"8388_CR36","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.engappai.2012.01.023","volume":"26","author":"M Yaghini","year":"2013","unstructured":"Yaghini M, Khoshraftar MM, Fallahi M (2013) A hybrid algorithm for artificial neural network training. Eng Appl Artif Intell 26(1):293\u2013301","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"8388_CR37","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/TEVC.2018.2878221","volume":"23","author":"X Yu","year":"2019","unstructured":"Yu X, Chen W-N, Gu T, Yuan H, Zhang H, Zhang J (2019) ACO-A*: ant colony optimization plus A* for 3-D traveling in environments with dense obstacles. IEEE Trans Evol Computat 23(4):617\u2013631","journal-title":"IEEE Trans Evol Computat"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08388-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08388-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08388-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T18:09:23Z","timestamp":1684951763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08388-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":37,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["8388"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08388-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"30 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}