{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T12:51:27Z","timestamp":1777035087567,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11961001,61561001"],"award-info":[{"award-number":["11961001,61561001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Construction Project of First-class Subjects in Ningxia Higher Education","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"name":"the Major Proprietary Funded Project of North Minzu University","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"DOI":"10.13039\/501100012481","name":"Graduate Innovation Project of North Minzu University","doi-asserted-by":"publisher","award":["YCX21152"],"award-info":[{"award-number":["YCX21152"]}],"id":[{"id":"10.13039\/501100012481","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Opposition-based differential evolution (ODE) is a well-known DE variant that employs opposition-based learning (OBL) to accelerate the convergence speed. However, the existing OBL variants are population-based, which causes many shortcomings. The value of the jumping rate is not self-adaptively adjusted, so the algorithm easily traps into local optima. The population-based OBL wastes fitness evaluations when the algorithm converges to sub-optimal. In this paper, we proposed a novel OBL called subpopulation-based OBL (SPOBL) with a self-adaptive parameter control strategy. In SPOBL, the jumping rate acts on the individual, and the subpopulation is selected according to the individual\u2019s jumping rate. In the self-adaptive parameter control strategy, the surviving individual\u2019s jumping rate in each iteration will participate in the self-adaptive process. A generalized Lehmer mean is introduced to achieve an equilibrium between exploration and exploitation. We used DE and advanced DE variants combined with SPOBL to verify performance. The results of performance are evaluated on the CEC 2017 and CEC 2020 test suites. The SPOBL shows better performance compared to other OBL variants in terms of benchmark functions as well as real-world constrained optimization problems.<\/jats:p>","DOI":"10.1007\/s40747-022-00734-5","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T04:07:05Z","timestamp":1651637225000},"page":"2051-2089","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Self-adaptive opposition-based differential evolution with subpopulation strategy for numerical and engineering optimization problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Jiahang","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qinwen","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"issue":"4","key":"734_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s40747-018-0080-1","volume":"4","author":"R Cheng","year":"2018","unstructured":"Cheng R, He C, Jin Y, Yao X (2018) Model-based evolutionary algorithms: a short survey. Complex Intell Syst 4(4):283\u2013292. https:\/\/doi.org\/10.1007\/s40747-018-0080-1","journal-title":"Complex Intell Syst"},{"issue":"2","key":"734_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/tevc.2019.2921598","volume":"24","author":"C Huang","year":"2020","unstructured":"Huang C, Li Y, Yao X (2020) A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans Evolut Comput 24(2):201\u2013216. https:\/\/doi.org\/10.1109\/tevc.2019.2921598","journal-title":"IEEE Trans Evolut Comput"},{"key":"734_CR3","doi-asserted-by":"publisher","first-page":"100888","DOI":"10.1016\/j.swevo.2021.100888","volume":"64","author":"E Osaba","year":"2021","unstructured":"Osaba E, Villar-Rodriguez E, Ser JD, Nebro AJ, Molina D, LaTorre A, Suganthan PN, Coello CAC, Herrera F (2021) A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems. Swarm Evolut Comput 64:100888. https:\/\/doi.org\/10.1016\/j.swevo.2021.100888","journal-title":"Swarm Evolut Comput"},{"issue":"7","key":"734_CR4","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.3390\/sym13071290","volume":"13","author":"L Wang","year":"2021","unstructured":"Wang L, Gao Y, Gao S, Yong X (2021) A new feature selection method based on a self-variant genetic algorithm applied to android malware detection. Symmetry 13(7):1290. https:\/\/doi.org\/10.3390\/sym13071290","journal-title":"Symmetry"},{"key":"734_CR5","doi-asserted-by":"publisher","unstructured":"Xu J, Jin Y, Du W (2021) A federated data-driven evolutionary algorithm for expensive multi-\/many-objective optimization. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00506-7","DOI":"10.1007\/s40747-021-00506-7"},{"key":"734_CR6","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.swevo.2019.04.008","volume":"48","author":"JD Ser","year":"2019","unstructured":"Ser JD, Osaba E, Molina D, Yang XS, Salcedo-Sanz S, Camacho D, Das S, Suganthan PN, Coello CAC, Herrera F (2019) Bio-inspired computation: where we stand and what\u2019s next. Swarm Evolut Comput 48:220\u2013250. https:\/\/doi.org\/10.1016\/j.swevo.2019.04.008","journal-title":"Swarm Evolut Comput"},{"key":"734_CR7","unstructured":"Storn R, Price K (1995) Differential evolution\u2014a simple and efficient adaptive scheme for global optimization over continuous spaces. Tech. Rep. TR-95-012, International Computer Science, Berkeley, California"},{"issue":"4","key":"734_CR8","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. https:\/\/doi.org\/10.1023\/a:1008202821328","journal-title":"J Global Optim"},{"issue":"1","key":"734_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/tevc.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evoluti Comput 15(1):4\u201331. https:\/\/doi.org\/10.1109\/tevc.2010.2059031","journal-title":"IEEE Trans Evoluti Comput"},{"key":"734_CR10","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 SS, Suganthan P (2016) Recent advances in differential evolution\u2014an updated survey. Swarm Evolut Comput 27:1\u201330. https:\/\/doi.org\/10.1016\/j.swevo.2016.01.004","journal-title":"Swarm Evolut Comput"},{"key":"734_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2019.08.040","volume":"507","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, wei Gong D, zhi Gao X, Tian T, yan Sun X (2020) Binary differential evolution with self-learning for multi-objective feature selection. Inform Sci 507:67\u201385. https:\/\/doi.org\/10.1016\/j.ins.2019.08.040","journal-title":"Inform Sci"},{"key":"734_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2019.03.013","volume":"80","author":"M Alswaitti","year":"2019","unstructured":"Alswaitti M, Albughdadi M, Isa NAM (2019) Variance-based differential evolution algorithm with an optional crossover for data clustering. Appl Soft Comput 80:1\u201317. https:\/\/doi.org\/10.1016\/j.asoc.2019.03.013","journal-title":"Appl Soft Comput"},{"key":"734_CR13","doi-asserted-by":"publisher","unstructured":"Aladeemy M, Adwan L, Booth A, Khasawneh MT, Poranki S (2020) New feature selection methods based on opposition-based learning and self-adaptive cohort intelligence for predicting patient no-shows. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2019.105866","DOI":"10.1016\/j.asoc.2019.105866"},{"issue":"1","key":"734_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40747-019-0102-7","volume":"6","author":"A Hussain","year":"2019","unstructured":"Hussain A, Muhammad YS (2019) Trade-off between exploration and exploitation with genetic algorithm using a novel selection operator. Complex Intell Syst 6(1):1\u201314. https:\/\/doi.org\/10.1007\/s40747-019-0102-7","journal-title":"Complex Intell Syst"},{"issue":"1","key":"734_CR15","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/tevc.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evolut Comput 12(1):64\u201379. https:\/\/doi.org\/10.1109\/tevc.2007.894200","journal-title":"IEEE Trans Evolut Comput"},{"key":"734_CR16","doi-asserted-by":"publisher","unstructured":"Tizhoosh H (2005) Opposition-based learning: a new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC\u201906). IEEE. https:\/\/doi.org\/10.1109\/cimca.2005.1631345","DOI":"10.1109\/cimca.2005.1631345"},{"issue":"11","key":"734_CR17","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1109\/tcyb.2014.2303117","volume":"44","author":"M Ergezer","year":"2014","unstructured":"Ergezer M, Simon D (2014) Mathematical and experimental analyses of oppositional algorithms. IEEE Trans Cybern 44(11):2178\u20132189. https:\/\/doi.org\/10.1109\/tcyb.2014.2303117","journal-title":"IEEE Trans Cybern"},{"key":"734_CR18","doi-asserted-by":"publisher","unstructured":"Ergezer M, Simon D, Du D (2009) Oppositional biogeography-based optimization. In: 2009 IEEE International Conference on Systems, Man and Cybernetics. IEEE. https:\/\/doi.org\/10.1109\/icsmc.2009.5346043","DOI":"10.1109\/icsmc.2009.5346043"},{"issue":"9","key":"734_CR19","doi-asserted-by":"publisher","first-page":"2828","DOI":"10.1016\/j.asoc.2012.03.034","volume":"12","author":"S Rahnamayan","year":"2012","unstructured":"Rahnamayan S, Wang GG, Ventresca M (2012) An intuitive distance-based explanation of opposition-based sampling. Appl Soft Comput 12(9):2828\u20132839. https:\/\/doi.org\/10.1016\/j.asoc.2012.03.034","journal-title":"Appl Soft Comput"},{"key":"734_CR20","doi-asserted-by":"publisher","unstructured":"Al-Qunaieer FS, Tizhoosh HR, Rahnamayan S (2010) Opposition based computing\u2014a survey. In: The 2010 International Joint Conference on Neural Networks (IJCNN). IEEE. https:\/\/doi.org\/10.1109\/ijcnn.2010.5596906","DOI":"10.1109\/ijcnn.2010.5596906"},{"key":"734_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2013.12.004","volume":"29","author":"Q Xu","year":"2014","unstructured":"Xu Q, Wang L, Wang N, Hei X, Zhao L (2014) A review of opposition-based learning from 2005 to 2012. Eng Appl Artif Intell 29:1\u201312. https:\/\/doi.org\/10.1016\/j.engappai.2013.12.004","journal-title":"Eng Appl Artif Intell"},{"key":"734_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2017.09.010","volume":"39","author":"S Mahdavi","year":"2018","unstructured":"Mahdavi S, Rahnamayan S, Deb K (2018) Opposition based learning: a literature review. Swarm Evolut Comput 39:1\u201323. https:\/\/doi.org\/10.1016\/j.swevo.2017.09.010","journal-title":"Swarm Evolut Comput"},{"key":"734_CR23","doi-asserted-by":"publisher","unstructured":"Esmailzadeh A, Rahnamayan S (2011) Opposition-based differential evolution with protective generation jumping. In: 2011 IEEE Symposium on Differential Evolution (SDE). IEEE. https:\/\/doi.org\/10.1109\/sde.2011.5952059","DOI":"10.1109\/sde.2011.5952059"},{"key":"734_CR24","doi-asserted-by":"publisher","unstructured":"Rahnamayan S, Tizhoosh HR, Salama MM (2007) Quasi-oppositional differential evolution. In: 2007 IEEE Congress on Evolutionary Computation. IEEE. https:\/\/doi.org\/10.1109\/cec.2007.4424748","DOI":"10.1109\/cec.2007.4424748"},{"issue":"11","key":"734_CR25","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1007\/s00500-010-0642-7","volume":"15","author":"H Wang","year":"2010","unstructured":"Wang H, Wu Z, Rahnamayan S (2010) Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems. Soft Comput 15(11):2127\u20132140. https:\/\/doi.org\/10.1007\/s00500-010-0642-7","journal-title":"Soft Comput"},{"issue":"5","key":"734_CR26","first-page":"1582","volume":"7","author":"Xu","year":"2011","unstructured":"Xu, Wang L, He B, Wang N (2011) Modified opposition-based differential evolution for function optimization. J Comput Inform Syst 7(5):1582\u20131591","journal-title":"J Comput Inform Syst"},{"key":"734_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.engappai.2014.09.009","volume":"37","author":"Z Seif","year":"2015","unstructured":"Seif Z, Ahmadi M (2015) An opposition-based algorithm for function optimization. Eng Appli Artif Intell 37:293\u2013306. https:\/\/doi.org\/10.1016\/j.engappai.2014.09.009","journal-title":"Eng Appli Artif Intell"},{"key":"734_CR28","doi-asserted-by":"publisher","unstructured":"Rahnamayan S, Jesuthasan J, Bourennani F, Salehinejad H, Naterer GF (2014) Computing opposition by involving entire population. In: 2014 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2014.6900329","DOI":"10.1109\/cec.2014.6900329"},{"key":"734_CR29","doi-asserted-by":"publisher","unstructured":"Alkayem NF, Shen L, Asteris PG, Sokol M, Xin Z, Cao M (2021) A new self-adaptive quasi-oppositional stochastic fractal search for the inverse problem of structural damage assessment. Alexand Eng J. https:\/\/doi.org\/10.1016\/j.aej.2021.06.094","DOI":"10.1016\/j.aej.2021.06.094"},{"key":"734_CR30","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.neucom.2021.01.003","volume":"435","author":"Y Xu","year":"2021","unstructured":"Xu Y, Yang X, Yang Z, Li X, Wang P, Ding R, Liu W (2021) An enhanced differential evolution algorithm with a new oppositional-mutual learning strategy. Neurocomputing 435:162\u2013175. https:\/\/doi.org\/10.1016\/j.neucom.2021.01.003","journal-title":"Neurocomputing"},{"key":"734_CR31","doi-asserted-by":"publisher","unstructured":"Choi TJ, Togelius J, Cheong YG (2021) A fast and efficient stochastic opposition-based learning for differential evolution in numerical optimization. Swarm Evolut Computat. https:\/\/doi.org\/10.1016\/j.swevo.2020.100768","DOI":"10.1016\/j.swevo.2020.100768"},{"key":"734_CR32","doi-asserted-by":"publisher","unstructured":"Kumar A, Wu G, Ali MZ, Mallipeddi R, Suganthan PN, Das S (2020) A test-suite of non-convex constrained optimization problems from the real-world and some baseline results. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100693","DOI":"10.1016\/j.swevo.2020.100693"},{"key":"734_CR33","unstructured":"Awad N, Ali M, JLBQ, Suganthan P (2016) Problem definitions and evalua- tion criteria for the cec 2017 special session and competition on single objective bound constrained real-parameter numerical optimization, technical report, ntu, singapore. Tech. rep"},{"key":"734_CR34","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.cor.2015.09.006","volume":"67","author":"L Cui","year":"2016","unstructured":"Cui L, Li G, Lin Q, Chen J, Lu N (2016) Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations. Comput Oper Res 67:155\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2015.09.006","journal-title":"Comput Oper Res"},{"issue":"5","key":"734_CR35","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/tevc.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang J, Sanderson A (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Computat 13(5):945\u2013958. https:\/\/doi.org\/10.1109\/tevc.2009.2014613","journal-title":"IEEE Trans Evol Computat"},{"key":"734_CR36","doi-asserted-by":"publisher","unstructured":"Wang H, Wu Z, Rahnamayan S, Wang J (2010) Diversity analysis of opposition-based differential evolution\u2014an experimental study. In: Advances in Computation and Intelligence, pp. 95\u2013102. Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-16493-4_10","DOI":"10.1007\/978-3-642-16493-4_10"},{"key":"734_CR37","doi-asserted-by":"publisher","unstructured":"Wang W, Wang H, Sun H, Rahnamayan S (2016) Using opposition-based learning to enhance differential evolution: A comparative study. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2016.7743780","DOI":"10.1109\/cec.2016.7743780"},{"issue":"1","key":"734_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evolut Comput"},{"issue":"10","key":"734_CR39","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inform Sci 180(10):2044\u20132064. https:\/\/doi.org\/10.1016\/j.ins.2009.12.010","journal-title":"Inform Sci"},{"key":"734_CR40","doi-asserted-by":"publisher","unstructured":"Tanabe R, Fukunaga AS (2014) Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2014.6900380","DOI":"10.1109\/cec.2014.6900380"},{"key":"734_CR41","doi-asserted-by":"publisher","unstructured":"Brest J, Maucec MS, Boskovic B (2017) Single objective real-parameter optimization: Algorithm jSO. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2017.7969456","DOI":"10.1109\/cec.2017.7969456"},{"key":"734_CR42","doi-asserted-by":"publisher","unstructured":"Tanabe R, Fukunaga A (2013) Success-history based parameter adaptation for differential evolution. In: 2013 IEEE Congress on Evolutionary Computation. IEEE. https:\/\/doi.org\/10.1109\/cec.2013.6557555","DOI":"10.1109\/cec.2013.6557555"},{"key":"734_CR43","doi-asserted-by":"publisher","unstructured":"Guo SM, Tsai JSH, Yang CC, Hsu PH (2015) A self-optimization approach for l-SHADE incorporated with eigenvector-based crossover and successful-parent-selecting framework on CEC 2015 benchmark set. In: 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2015.7256999","DOI":"10.1109\/cec.2015.7256999"},{"key":"734_CR44","doi-asserted-by":"publisher","unstructured":"Sallam KM, Sarker RA, Essam DL, Elsayed SM (2015) Neurodynamic differential evolution algorithm and solving CEC2015 competition problems. In: 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE . https:\/\/doi.org\/10.1109\/cec.2015.7257003","DOI":"10.1109\/cec.2015.7257003"},{"key":"734_CR45","doi-asserted-by":"publisher","unstructured":"Brest J, Maucec MS, Boskovic B (2016) iL-SHADE: Improved l-SHADE algorithm for single objective real-parameter optimization. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2016.7743922","DOI":"10.1109\/cec.2016.7743922"},{"key":"734_CR46","doi-asserted-by":"publisher","unstructured":"Awad NH, Ali MZ, Suganthan PN, Reynolds RG (2016) An ensemble sinusoidal parameter adaptation incorporated with l-SHADE for solving CEC2014 benchmark problems. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2016.7744163","DOI":"10.1109\/cec.2016.7744163"},{"key":"734_CR47","doi-asserted-by":"publisher","unstructured":"Awad NH, Ali MZ, Suganthan PN, Reynolds RG, Shatnawi AM (2017) A novel differential crossover strategy based on covariance matrix learning with euclidean neighborhood for solving real-world problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2017.7969337","DOI":"10.1109\/cec.2017.7969337"},{"key":"734_CR48","doi-asserted-by":"publisher","unstructured":"Awad NH, Ali MZ, Suganthan PN (2017) Ensemble sinusoidal differential covariance matrix adaptation with euclidean neighborhood for solving CEC2017 benchmark problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2017.7969336","DOI":"10.1109\/cec.2017.7969336"},{"key":"734_CR49","doi-asserted-by":"publisher","unstructured":"Stanovov V, Akhmedova S, Semenkin E (2018) LSHADE algorithm with rank-based selective pressure strategy for solving CEC 2017 benchmark problems. In: 2018 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec.2018.8477977","DOI":"10.1109\/cec.2018.8477977"},{"key":"734_CR50","doi-asserted-by":"publisher","unstructured":"Kumar A, Das S, Zelinka I (2020) A self-adaptive spherical search algorithm for real-world constrained optimization problems. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. ACM. https:\/\/doi.org\/10.1145\/3377929.3398186","DOI":"10.1145\/3377929.3398186"},{"key":"734_CR51","doi-asserted-by":"publisher","unstructured":"Kumar A, Das S, Zelinka I (2020) A modified covariance matrix adaptation evolution strategy for real-world constrained optimization problems. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. ACM. https:\/\/doi.org\/10.1145\/3377929.3398185","DOI":"10.1145\/3377929.3398185"},{"key":"734_CR52","doi-asserted-by":"publisher","unstructured":"Gurrola-Ramos J, Hernandez-Aguirre A, Dalmau-Cedeno O (2020) COLSHADE for real-world single-objective constrained optimization problems. In: 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE. https:\/\/doi.org\/10.1109\/cec48606.2020.9185583","DOI":"10.1109\/cec48606.2020.9185583"},{"issue":"5","key":"734_CR53","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/49.56381","volume":"8","author":"M Dukic","year":"1990","unstructured":"Dukic M, Dobrosavljevic Z (1990) A method of a spread-spectrum radar polyphase code design. IEEE J Select Areas Commun 8(5):743\u2013749. https:\/\/doi.org\/10.1109\/49.56381","journal-title":"IEEE J Select Areas Commun"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00734-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00734-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00734-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T01:30:32Z","timestamp":1653874232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00734-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["734"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00734-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"12 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and\/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled, \u201cSelf-adaptive opposition-based differential evolution with subpopulation strategy for numerical and engineering optimization problems\u201d.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}