{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:29:47Z","timestamp":1768739387785,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The National Key Research and Development of China","award":["2017YFB0503004"],"award-info":[{"award-number":["2017YFB0503004"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00500-020-05488-1","type":"journal-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T11:14:51Z","timestamp":1609845291000},"page":"4799-4822","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Empirical distribution-based framework for improving multi-parent crossover algorithms"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-6332","authenticated-orcid":false,"given":"Zhengkang","family":"Zuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-1426","authenticated-orcid":false,"given":"Sana","family":"Ullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruihua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0499-3460","authenticated-orcid":false,"given":"Hongying","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"issue":"4","key":"5488_CR1","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s12597-015-0208-7","volume":"52","author":"ZH Ahmed","year":"2015","unstructured":"Ahmed ZH (2015) A multi-parent genetic algorithm for the quadratic assignment problem. Opsearch 52(4):714\u2013732","journal-title":"Opsearch"},{"key":"5488_CR2","unstructured":"Brits R, Engelbrecht AP, Van den Bergh F (2002) A niching particle swarm optimizer. In: Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning, vol 2, pp 692\u2013696"},{"issue":"3","key":"5488_CR3","first-page":"355","volume":"6","author":"A Caboussat","year":"2009","unstructured":"Caboussat A, Glowinski R, Pons V (2009) Numerical methods for non-smooth L1 optimization: applications to free surface flows and image denoising. Int J Numer Anal Model 6(3):355\u2013374","journal-title":"Int J Numer Anal Model"},{"key":"5488_CR4","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"issue":"1","key":"5488_CR5","first-page":"211","volume":"193","author":"K Deep","year":"2007","unstructured":"Deep K, Thakur M (2007) A new mutation operator for real coded genetic algorithms. Appl Math Comput 193(1):211\u2013230","journal-title":"Appl Math Comput"},{"key":"5488_CR6","doi-asserted-by":"crossref","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS\u201995. Proceedings of the sixth international symposium on micro machine and human science, pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"issue":"3","key":"5488_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1162\/evco.1997.5.3.347","volume":"5","author":"AE Eiben","year":"1997","unstructured":"Eiben AE, Back T (1997) Empirical investigation of multiparent recombination operators in evolution strategies. Evol Comput 5(3):347\u2013365","journal-title":"Evol Comput"},{"key":"5488_CR8","doi-asserted-by":"crossref","unstructured":"Eiben \u00c1E, Schippers CA (1996) Multi-parent\u2019s niche: n-ary crossovers on NK-landscapes. In: International conference on parallel problem solving from nature, pp 319\u2013328","DOI":"10.1007\/3-540-61723-X_996"},{"key":"5488_CR9","doi-asserted-by":"crossref","unstructured":"Eiben AE, Raue PE, Ruttkay Z (1994) Genetic algorithms with multi-parent recombination. In: International conference on parallel problem solving from nature, pp 78\u201387","DOI":"10.1007\/3-540-58484-6_252"},{"key":"5488_CR10","doi-asserted-by":"crossref","unstructured":"Eiben \u00c1E, van Kemenade CH, Kok JN (1995) Orgy in the computer: multi-parent reproduction in genetic algorithms. In: European conference on artificial life, pp 934\u2013945","DOI":"10.1007\/3-540-59496-5_354"},{"key":"5488_CR11","doi-asserted-by":"crossref","unstructured":"Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and interval-schemata. In: Foundations of genetic algorithms, vol 2 pp 187\u2013202","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"key":"5488_CR12","unstructured":"Franken M, Rumpf M, Wirth B (2011) A phase field based PDE constraint optimization approach to time discrete Willmore flow. Int J Numer Anal Model"},{"issue":"2","key":"5488_CR13","first-page":"139","volume":"5","author":"DE Goldberg","year":"1991","unstructured":"Goldberg DE (1991) Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Syst 5(2):139\u2013167","journal-title":"Complex Syst"},{"issue":"4","key":"5488_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F Herrera","year":"1998","unstructured":"Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif Intell Rev 12(4):265\u2013319","journal-title":"Artif Intell Rev"},{"issue":"1","key":"5488_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Am 267(1):66\u201373","journal-title":"Sci Am"},{"key":"5488_CR16","unstructured":"Janikow CZ, Michalewicz Z (1991) An experimental comparison of binary and floating point representations in genetic algorithms. In: ICGA, pp 31\u201336"},{"key":"5488_CR17","doi-asserted-by":"crossref","unstructured":"Jia R, He D (2012) Hybrid artificial bee colony algorithm for solving nonlinear system of equations. In: 2012 Eighth international conference on computational intelligence and security, pp 56\u201360","DOI":"10.1109\/CIS.2012.21"},{"issue":"12","key":"5488_CR18","first-page":"98","volume":"38","author":"D Jiang","year":"2010","unstructured":"Jiang D, Lin J (2010) A unified multi-parent combination algorithm. Huazhong Keji Daxue Xuebao(Ziran Kexue Ban)\/J Huazhong Univ Sci Technol (Nat Sci Ed) 38(12):98\u2013101 (in Chinese)","journal-title":"Huazhong Keji Daxue Xuebao(Ziran Kexue Ban)\/J Huazhong Univ Sci Technol (Nat Sci Ed)"},{"key":"5488_CR19","unstructured":"Michalewicz Z (2013) Genetic algorithms\u00a0+ data structures\u00a0= evolution programs. Springer Science & Business Media"},{"key":"5488_CR20","unstructured":"Ono I, Kobayashi S (1999) A real-coded genetic algorithm for function optimization using unimodal normal distribution. In: Proceedings of international conference on genetic algorithms, pp 246\u2013253"},{"key":"5488_CR21","doi-asserted-by":"crossref","unstructured":"Phyu SPTP, Srijuntongsiri G (2016) A binary coded multi-parent genetic algorithm for shuttle bus routing system in a college campus. In: 2016 international conference on advanced informatics: concepts, theory and application (ICAICTA), pp 1\u20135","DOI":"10.1109\/ICAICTA.2016.7803089"},{"key":"5488_CR22","doi-asserted-by":"crossref","unstructured":"Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: 2005 IEEE congress on evolutionary computation, vol 2, pp 1785\u20131791","DOI":"10.1109\/CEC.2005.1554904"},{"issue":"2","key":"5488_CR23","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2008","unstructured":"Qin AK, Huang VL, Suganthan PN (2008) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398\u2013417","journal-title":"IEEE Trans Evol Comput"},{"key":"5488_CR24","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360), pp 69\u201373","DOI":"10.1109\/ICEC.1998.699146"},{"issue":"4","key":"5488_CR25","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"issue":"4","key":"5488_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/bf02832273","volume":"4","author":"G Tao","year":"1999","unstructured":"Tao G, Li-shan K (1999) A new evolutionary algorithm for function optimization. Wuhan Univ J Nat Sci 4(4):409\u2013414. https:\/\/doi.org\/10.1007\/bf02832273","journal-title":"Wuhan Univ J Nat Sci"},{"key":"5488_CR27","volume-title":"Vehicle routing: problems, methods, and applications","year":"2014","unstructured":"Toth P, Vigo D (eds) (2014) Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"5488_CR28","doi-asserted-by":"crossref","unstructured":"Tsutsui S, Ghosh A (1998) A study on the effect of multi-parent recombination in real coded genetic algorithms. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), pp 828\u2013833","DOI":"10.1109\/ICEC.1998.700159"},{"key":"5488_CR29","doi-asserted-by":"crossref","unstructured":"Wright AH (1991) Genetic algorithms for real parameter optimization. In: Foundations of genetic algorithms, vol 1, pp 205\u2013218","DOI":"10.1016\/B978-0-08-050684-5.50016-1"},{"key":"5488_CR30","unstructured":"Wu Z, Kang L, Zou X (2002) A parallel global-local mixed evolutionary algorithm for multimodal function optimization. In: Fifth international conference on algorithms and architectures for parallel processing, 2002. Proceedings, pp 247\u2013250"},{"issue":"2","key":"5488_CR31","first-page":"13","volume":"23","author":"Z Wu","year":"2003","unstructured":"Wu Z, Kang L, Zou X (2003) An elite subspace evolutionary algorithm for solving function optimization problems. Comput Appl 23(2):13\u201315 (in Chinese)","journal-title":"Comput Appl"},{"issue":"1","key":"5488_CR39","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02899489","volume":"8","author":"Z Wu","year":"2003","unstructured":"Wu Z, Tang Z, Kang L (2003) A parallel global-local mixed evolutionary algorithm for multimodal function optimization based on domain decomposition. Wuhan Univ J Nat Sci 8(1):253\u2013258","journal-title":"Wuhan Univ J Nat Sci"},{"key":"5488_CR32","doi-asserted-by":"crossref","unstructured":"Xu X, Zhang J (2007) An improved immune evolutionary algorithm for multimodal function optimization. In: Third international conference on natural computation (ICNC 2007), vol 3, pp 641\u2013646","DOI":"10.1109\/ICNC.2007.216"},{"issue":"2","key":"5488_CR33","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1051\/m2an\/2016030","volume":"51","author":"Y Xu","year":"2017","unstructured":"Xu Y, Zou J (2017) A convergent adaptive edge element method for an optimal control problem in magnetostatics. ESAIM Math Model Numer Anal 51(2):615\u2013640","journal-title":"ESAIM Math Model Numer Anal"},{"key":"5488_CR34","doi-asserted-by":"crossref","unstructured":"Yang Z, Yao X, He J (2007) Making a difference to differential evolution. In: Advances in metaheuristics for hard optimization, pp 397\u2013414","DOI":"10.1007\/978-3-540-72960-0_19"},{"key":"5488_CR35","doi-asserted-by":"crossref","unstructured":"Yang Z, Tang K, Yao X (2008) Self-adaptive differential evolution with neighborhood search. In: 2008 IEEE congress on evolutionary computation (IEEE World Congress on Computational Intelligence), pp 1110\u20131116","DOI":"10.1109\/CEC.2008.4630935"},{"issue":"7","key":"5488_CR36","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00500-013-1147-y","volume":"18","author":"Y Zhang","year":"2014","unstructured":"Zhang Y, Gong DW, Sun XY, Geng N (2014) Adaptive bare-bones particle swarm optimization algorithm and its convergence analysis. Soft Comput 18(7):1337\u20131352","journal-title":"Soft Comput"},{"key":"5488_CR37","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ins.2017.08.047","volume":"418","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, Song XF, Gong DW (2017) A return-cost-based binary firefly algorithm for feature selection. Inf Sci 418:561\u2013574","journal-title":"Inf Sci"},{"issue":"4\u20135","key":"5488_CR38","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1177\/0278364914551583","volume":"34","author":"L Zhao","year":"2015","unstructured":"Zhao L, Huang S, Sun Y, Yan L, Dissanayake G (2015) Parallaxba: bundle adjustment using parallax angle feature parametrization. Int J Robot Res 34(4\u20135):493\u2013516","journal-title":"Int J Robot Res"},{"issue":"1","key":"5488_CR40","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ast.2013.11.003","volume":"32","author":"W Zhu","year":"2014","unstructured":"Zhu W, Duan H (2014) Chaotic predator\u2013prey biogeography-based optimization approach for UCA V path planning. Aerosp Sci Technol 32(1):153\u2013161","journal-title":"Aerosp Sci Technol"},{"key":"5488_CR41","doi-asserted-by":"publisher","unstructured":"Zuo Z, Wu Z, Sun Y, Zhang R, Yan L (2020) Accelerating the generation of coefficient vectors in elite multiparent crossover algorithm by using empirical probability density curve. Eng J Wuhan Univ 53(08):728\u2013733 (in Chinese). https:\/\/doi.org\/10.14188\/j.1671-8844.2020-08-011","DOI":"10.14188\/j.1671-8844.2020-08-011"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05488-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05488-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05488-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T15:18:53Z","timestamp":1730128733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05488-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5488"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05488-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Statement"}},{"value":"Authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}