{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:19Z","timestamp":1740123679115,"version":"3.37.3"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T00:00:00Z","timestamp":1649462400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T00:00:00Z","timestamp":1649462400000},"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":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10710-022-09430-2","type":"journal-article","created":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T08:02:39Z","timestamp":1649491359000},"page":"193-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the performance of the Bayesian optimization algorithm with combined scenarios of search algorithms and scoring metrics"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0617-7611","authenticated-orcid":false,"given":"Ciniro A. L.","family":"Nametala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wandry R.","family":"Faria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benvindo R.","family":"Pereira J\u00fanior","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,9]]},"reference":[{"issue":"2\u20133","key":"9430_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/bf00113892","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"D.E. Goldberg, J.H. Holland, Genetic algorithms and machine learning. Mach. Learn. 3(2\u20133), 95\u201399 (1988). https:\/\/doi.org\/10.1007\/bf00113892","journal-title":"Mach. Learn."},{"key":"9430_CR2","doi-asserted-by":"publisher","DOI":"10.14195\/978-989-26-0583-8","volume-title":"Manual de computa\u00e7\u00e3o evolutiva e metaheur\u00edstica","author":"A Gaspar Cunha","year":"2012","unstructured":"A. Gaspar Cunha, R. Takahashi, C.H. Antunes, Manual de computa\u00e7\u00e3o evolutiva e metaheur\u00edstica (Imprensa da Universidade de Coimbra, Coimbra, 2012). https:\/\/doi.org\/10.14195\/978-989-26-0583-8"},{"key":"9430_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/931256","volume":"2015","author":"Y Zhang","year":"2015","unstructured":"Y. Zhang, S. Wang, G. Ji, A comprehensive survey on particle swarm optimization algorithm and its applications. Math. Probl. Eng. 2015, 1 (2015). https:\/\/doi.org\/10.1155\/2015\/931256","journal-title":"Math. Probl. Eng."},{"key":"9430_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.ins.2014.10.042","volume":"295","author":"S Mahdavi","year":"2015","unstructured":"S. Mahdavi, M.E. Shiri, S. Rahnamayan, Metaheuristics in large-scale global continues optimization: a survey. Inf. Sci. 295, 407\u2013428 (2015). https:\/\/doi.org\/10.1016\/j.ins.2014.10.042","journal-title":"Inf. Sci."},{"issue":"3","key":"9430_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1162\/106365600750078808","volume":"8","author":"M Pelikan","year":"2000","unstructured":"M. Pelikan, D.E. Goldberg, E. Cantu-Paz, Linkage problem, distribution estimation, and bayesian networks. Evol. Comput. 8(3), 311\u2013340 (2000). https:\/\/doi.org\/10.1162\/106365600750078808","journal-title":"Evol. Comput."},{"issue":"1","key":"9430_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10710-006-9008-4","volume":"8","author":"I Tanev","year":"2007","unstructured":"I. Tanev, Genetic programming incorporating biased mutation for evolution and adaptation of snakebot. Genet. Programm. Evolvable Mach. 8(1), 39\u201359 (2007). https:\/\/doi.org\/10.1007\/s10710-006-9008-4","journal-title":"Genet. Programm. Evolvable Mach."},{"issue":"3","key":"9430_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H M\u00fchlenbein","year":"1997","unstructured":"H. M\u00fchlenbein, The equation for response to selection and its use for prediction. Evol. Comput. 5(3), 303\u2013346 (1997). https:\/\/doi.org\/10.1162\/evco.1997.5.3.303","journal-title":"Evol. Comput."},{"key":"9430_CR8","doi-asserted-by":"publisher","unstructured":"S. Baluja, Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical report, Carnegie Mellon University (1994). https:\/\/doi.org\/10.5555\/865123","DOI":"10.5555\/865123"},{"issue":"2","key":"9430_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1015579825262","volume":"3","author":"J Smith","year":"2002","unstructured":"J. Smith, On appropriate adaptation levels for the learning of gene linkage. Genet. Program Evolvable Mach. 3(2), 129\u2013155 (2002). https:\/\/doi.org\/10.1023\/A:1015579825262","journal-title":"Genet. Program Evolvable Mach."},{"issue":"6","key":"9430_CR10","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TEVC.2020.2985497","volume":"24","author":"MW Przewozniczek","year":"2020","unstructured":"M.W. Przewozniczek, M.M. Komarnicki, Empirical linkage learning. IEEE Trans. Evol. Comput. 24(6), 1097\u20131111 (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.2985497","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9430_CR11","doi-asserted-by":"publisher","unstructured":"G.R. Harik, F.G. Lobo, K. Sastry, Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ECGA), in Scalable Optimization via Probabilistic Modeling (Springer, Berlin, Heidelberg, 2006), pp. 39\u201361. https:\/\/doi.org\/10.1007\/978-3-540-34954-9_3","DOI":"10.1007\/978-3-540-34954-9_3"},{"key":"9430_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The Design of Innovation: Lessons from and for Competent Genetic Algorithms","author":"DE Goldberg","year":"2013","unstructured":"D.E. Goldberg, The Design of Innovation: Lessons from and for Competent Genetic Algorithms, vol. 7 (Springer, Berlin, 2013). https:\/\/doi.org\/10.1007\/978-1-4757-3643-4"},{"key":"9430_CR13","doi-asserted-by":"publisher","unstructured":"M. Pelikan, D.E. Goldberg, E. Cant\u00fa-Paz, et al., Boa: the bayesian optimization algorithm, in Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, vol. 1 (1999), pp. 525\u2013532. https:\/\/doi.org\/10.5555\/2933923.2933973","DOI":"10.5555\/2933923.2933973"},{"key":"9430_CR14","doi-asserted-by":"publisher","unstructured":"M.K. Crocomo, Algoritmo de otimiza\u00e7ao bayesiano com detec\u00e7ao de comunidades. PhD thesis, Universidade de S\u00e3o Paulo (2012). https:\/\/doi.org\/10.11606\/T.55.2012.tde-23012013-160605","DOI":"10.11606\/T.55.2012.tde-23012013-160605"},{"issue":"4","key":"9430_CR15","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/tvlsi.2017.2784783","volume":"26","author":"HM Torun","year":"2018","unstructured":"H.M. Torun, M. Swaminathan, A.K. Davis, M.L.F. Bellaredj, A global bayesian optimization algorithm and its application to integrated system design. IEEE Trans. Very Large Scale Integr. VLSI Syst. 26(4), 792\u2013802 (2018). https:\/\/doi.org\/10.1109\/tvlsi.2017.2784783","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."},{"key":"9430_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.apenergy.2019.01.055","volume":"237","author":"F He","year":"2019","unstructured":"F. He, J. Zhou, Z. Feng, G. Liu, Y. Yang, A hybrid short-term load forecasting model based on variational mode decomposition and long short-term memory networks considering relevant factors with bayesian optimization algorithm. Appl. Energy 237, 103\u2013116 (2019). https:\/\/doi.org\/10.1016\/j.apenergy.2019.01.055","journal-title":"Appl. Energy"},{"key":"9430_CR17","doi-asserted-by":"publisher","unstructured":"R. Ding, W. Zhou, H. Cheng, A novel hybrid model of wind speed forecasting based on EWT, BiLSTM, SVR optimized by BOA in inner Mongolia, China, in Lecture Notes in Electrical Engineering (Springer, Singapore, 2019), pp. 183\u2013191. https:\/\/doi.org\/10.1007\/978-981-32-9686-2_23","DOI":"10.1007\/978-981-32-9686-2_23"},{"key":"9430_CR18","doi-asserted-by":"publisher","unstructured":"B. Huang, Q. Ding, G. Sun, H. Li, Stock prediction based on bayesian-lstm, in Proceedings of the 2018 10th International Conference on Machine Learning and Computing (2018), pp. 128\u2013133. https:\/\/doi.org\/10.1145\/3195106.3195170","DOI":"10.1145\/3195106.3195170"},{"issue":"1","key":"9430_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00122-017-2988-z","volume":"131","author":"R Tanaka","year":"2017","unstructured":"R. Tanaka, H. Iwata, Bayesian optimization for genomic selection: a method for discovering the best genotype among a large number of candidates. Theor. Appl. Genet. 131(1), 93\u2013105 (2017). https:\/\/doi.org\/10.1007\/s00122-017-2988-z","journal-title":"Theor. Appl. Genet."},{"issue":"9","key":"9430_CR20","doi-asserted-by":"publisher","first-page":"5211","DOI":"10.1039\/c9cp06688h","volume":"22","author":"L Chan","year":"2020","unstructured":"L. Chan, G.R. Hutchison, G.M. Morris, BOKEI: bayesian optimization using knowledge of correlated torsions and expected improvement for conformer generation. Phys. Chem. Chem. Phys. 22(9), 5211\u20135219 (2020). https:\/\/doi.org\/10.1039\/c9cp06688h","journal-title":"Phys. Chem. Chem. Phys."},{"key":"9430_CR21","doi-asserted-by":"publisher","unstructured":"C.W. Ahn, R.S. Ramakrishna, D.E. Goldberg, Real-coded bayesian optimization algorithm: bringing the strength of boa into the continuous world, in Genetic and Evolutionary Computation Conference (Springer, 2004), pp. 840\u2013851. https:\/\/doi.org\/10.1007\/978-3-540-24854-5_86","DOI":"10.1007\/978-3-540-24854-5_86"},{"key":"9430_CR22","doi-asserted-by":"publisher","unstructured":"M. Pelikan, D.E. Goldberg, Hierarchical bayesian optimization algorithm, in Scalable Optimization via Probabilistic Modeling (Springer, 2006), pp. 63\u201390. https:\/\/doi.org\/10.1007\/b10910","DOI":"10.1007\/b10910"},{"key":"9430_CR23","doi-asserted-by":"publisher","unstructured":"J. O\u010den\u00e1\u0161ek, J. Schwarz, The parallel bayesian optimization algorithm, in The State of the Art in Computational Intelligence (Springer, 2000), pp. 61\u201367. https:\/\/doi.org\/10.1007\/978-3-7908-1844-4_11","DOI":"10.1007\/978-3-7908-1844-4_11"},{"key":"9430_CR24","unstructured":"N. Khan, D.E. Goldberg, M. Pelikan, Multi-objective bayesian optimization algorithm, in Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation (Citeseer, 2002), pp. 684\u2013684"},{"issue":"4","key":"9430_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s13748-019-00194-y","volume":"8","author":"M Scanagatta","year":"2019","unstructured":"M. Scanagatta, A. Salmer\u00f3n, F. Stella, A survey on bayesian network structure learning from data. Prog. Artif. Intell. 8(4), 425\u2013439 (2019). https:\/\/doi.org\/10.1007\/s13748-019-00194-y","journal-title":"Prog. Artif. Intell."},{"issue":"1","key":"9430_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","volume":"65","author":"I Tsamardinos","year":"2006","unstructured":"I. Tsamardinos, L.E. Brown, C.F. Aliferis, The max-min hill-climbing bayesian network structure learning algorithm. Mach. Learn. 65(1), 31\u201378 (2006). https:\/\/doi.org\/10.1007\/s10994-006-6889-7","journal-title":"Mach. Learn."},{"key":"9430_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ijar.2019.10.003","volume":"115","author":"M Scutari","year":"2019","unstructured":"M. Scutari, C.E. Graafland, J.M. Guti\u00e9rrez, Who learns better bayesian network structures: Accuracy and speed of structure learning algorithms. Int. J. Approx. Reason. 115, 235\u2013253 (2019). https:\/\/doi.org\/10.1016\/j.ijar.2019.10.003","journal-title":"Int. J. Approx. Reason."},{"key":"9430_CR28","unstructured":"M. Scutari, An empirical-Bayes score for discrete Bayesian networks, in Proceedings of the Eighth International Conference on Probabilistic Graphical Models ed. by A. Antonucci, G. Corani, C.P. Campos (2016), pp. 438\u2013448"},{"key":"9430_CR29","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1591878","author":"S Beretta","year":"2018","unstructured":"S. Beretta, M. Castelli, I. Gon\u00e7alves, R. Henriques, D. Ramazzotti, Learning the structure of bayesian networks: a quantitative assessment of the effect of different algorithmic schemes. Complexity (2018). https:\/\/doi.org\/10.1155\/2018\/1591878","journal-title":"Complexity"},{"issue":"1","key":"9430_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/a:1013500812258","volume":"21","author":"M Pelikan","year":"2002","unstructured":"M. Pelikan, D.E. Goldberg, F.G. Lobo, A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 21(1), 5\u201320 (2002). https:\/\/doi.org\/10.1023\/a:1013500812258","journal-title":"Comput. Optim. Appl."},{"key":"9430_CR31","doi-asserted-by":"publisher","unstructured":"M. Pelikan, D.E Goldberg, K. Sastry, et al., Bayesian optimization algorithm, decision graphs, and occam\u2019s razor, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), vol. 519526 (2001). https:\/\/doi.org\/10.5555\/2955239.2955319","DOI":"10.5555\/2955239.2955319"},{"key":"9430_CR32","doi-asserted-by":"publisher","unstructured":"H. Karshenas, A. Nikanjam, B.H. Helmi, A.T. Rahmani, Combinatorial effects of local structures and scoring metrics in bayesian optimization algorithm, in Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation - GEC \u201909 (ACM Press, 2009). https:\/\/doi.org\/10.1145\/1543834.1543870","DOI":"10.1145\/1543834.1543870"},{"key":"9430_CR33","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.ins.2016.01.090","volume":"348","author":"S Gheisari","year":"2016","unstructured":"S. Gheisari, M.R. Meybodi, BNC-PSO: structure learning of bayesian networks by particle swarm optimization. Inf. Sci. 348, 272\u2013289 (2016). https:\/\/doi.org\/10.1016\/j.ins.2016.01.090","journal-title":"Inf. Sci."},{"key":"9430_CR34","doi-asserted-by":"publisher","unstructured":"A.H.M. Soares, Algoritmos de estima\u00e7\u00e3o de distribui\u00e7\u00e3o baseados em \u00e1rvores filogen\u00e9ticas. PhD thesis, Universidade de S\u00e3o Paulo (2014). https:\/\/doi.org\/10.11606\/T.55.2014.tde-25032015-111952","DOI":"10.11606\/T.55.2014.tde-25032015-111952"},{"key":"9430_CR35","doi-asserted-by":"publisher","unstructured":"J. Martins, Analysis of Linkage Learning in Evolutionary Optimization. PhD thesis, Universidade de S\u00e3o Paulo, 05 (2015). https:\/\/doi.org\/10.13140\/RG.2.1.4317.2325\/1","DOI":"10.13140\/RG.2.1.4317.2325\/1"},{"key":"9430_CR36","first-page":"0136042597","volume-title":"Artificial Intelligence : A Modern Approach","author":"S Russell","year":"2010","unstructured":"S. Russell, Artificial Intelligence\u202f: A Modern Approach, 3rd edn. (Prentice Hall, Upper Saddle River, 2010), p. 0136042597","edition":"3"},{"issue":"1","key":"9430_CR37","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"F. Glover, Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977). https:\/\/doi.org\/10.1111\/j.1540-5915.1977.tb01074.x","journal-title":"Decis. Sci."},{"key":"9430_CR38","doi-asserted-by":"crossref","unstructured":"K.B. Korb, A.E. Nicholson, Bayesian Artificial Intelligence (CRC Press, Boca Raton, 2010). ISBN 9781439815915","DOI":"10.1201\/b10391"},{"issue":"6","key":"9430_CR39","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/tac.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"H. Akaike, A new look at the statistical model identification. IEEE Trans. Autom. Control 19(6), 716\u2013723 (1974). https:\/\/doi.org\/10.1109\/tac.1974.1100705","journal-title":"IEEE Trans. Autom. Control"},{"key":"9430_CR40","first-page":"445","volume":"2","author":"David Maxwell Chickering","year":"2002","unstructured":"David Maxwell Chickering, Learning equivalence classes of bayesian-network structures. J. Mach. Learn. Res. 2, 445\u2013498 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"9430_CR41","doi-asserted-by":"publisher","unstructured":"C. Echegoyen, J.A. Lozano, R. Santana, P. Larranaga, Exact bayesian network learning in estimation of distribution algorithms, in 2007 IEEE Congress on Evolutionary Computation (IEEE, 2007). https:\/\/doi.org\/10.1109\/cec.2007.4424586","DOI":"10.1109\/cec.2007.4424586"},{"issue":"3","key":"9430_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v035.i03","volume":"35","author":"M Scutari","year":"2010","unstructured":"M. Scutari, Learning bayesian networks with the bnlearn r package. J. Stat. Softw. 35(3), 1 (2010). https:\/\/doi.org\/10.18637\/jss.v035.i03","journal-title":"J. Stat. Softw."},{"key":"9430_CR43","doi-asserted-by":"publisher","unstructured":"A. Ankan, A. Panda, pgmpy: probabilistic graphical models using python, in Proceedings of the 14th Python in Science Conference (SCIPY 2015) (Citeseer, 2015). https:\/\/doi.org\/10.25080\/Majora-7b98e3ed-001","DOI":"10.25080\/Majora-7b98e3ed-001"},{"issue":"1","key":"9430_CR44","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, I.H. Witten, The WEKA data mining software. ACM SIGKDD Explor. Newsl. 11(1), 10 (2009). https:\/\/doi.org\/10.1145\/1656274.1656278","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"9430_CR45","doi-asserted-by":"publisher","unstructured":"Y. Lavinas, C. Aranha, T. Sakurai, M. Ladeira, Experimental analysis of the tournament size on genetic algorithms, in 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC) (2018). pp. 3647\u20133653. https:\/\/doi.org\/10.1109\/SMC.2018.00617","DOI":"10.1109\/SMC.2018.00617"},{"issue":"3","key":"9430_CR46","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TBC.2012.2191029","volume":"58","author":"Y Wang","year":"2012","unstructured":"Y. Wang, W. Chen, C. Tellambura, Genetic algorithm based nearly optimal peak reduction tone set selection for adaptive amplitude clipping papr reduction. IEEE Trans. Broadcast. 58(3), 462\u2013471 (2012). https:\/\/doi.org\/10.1109\/TBC.2012.2191029","journal-title":"IEEE Trans. Broadcast."},{"key":"9430_CR47","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ins.2020.06.036","volume":"539","author":"H Zhang","year":"2020","unstructured":"H. Zhang, F. Liu, Y. Zhou, Z. Zhang, A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem. Inf. Sci. 539, 347\u2013374 (2020). https:\/\/doi.org\/10.1016\/j.ins.2020.06.036","journal-title":"Inf. Sci."},{"issue":"4","key":"9430_CR48","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/bf00994110","volume":"9","author":"GF Cooper","year":"1992","unstructured":"G.F. Cooper, E. Herskovits, A bayesian method for the induction of probabilistic networks from data. Mach. Learn. 9(4), 309\u2013347 (1992). https:\/\/doi.org\/10.1007\/bf00994110","journal-title":"Mach. Learn."},{"issue":"3","key":"9430_CR49","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ijar.2019.10.003","volume":"20","author":"D Heckerman","year":"1995","unstructured":"D. Heckerman, D. Geiger, D.M. Chickering, Learning bayesian networks: the combination of knowledge and statistical data. Mach. Learn. 20(3), 197\u2013243 (1995). https:\/\/doi.org\/10.1016\/j.ijar.2019.10.003","journal-title":"Mach. Learn."},{"key":"9430_CR50","doi-asserted-by":"publisher","unstructured":"C. Aparecido L. Nametala, W.R. Faria, B.R. Pereira J\u00fanior, On the Performance of the Bayesian Optimization Algorithm with Combined Scenarios of Search Algorithms and Scoring Metrics: R Source Code and Experiment Data (2021). https:\/\/doi.org\/10.5281\/zenodo.4710554","DOI":"10.5281\/zenodo.4710554"},{"issue":"4","key":"9430_CR51","doi-asserted-by":"publisher","first-page":"547","DOI":"10.2307\/2986146","volume":"44","author":"P Royston","year":"1995","unstructured":"P. Royston, Remark AS r94: a remark on algorithm AS 181: the w-test for normality. Appl. Stat. 44(4), 547 (1995). https:\/\/doi.org\/10.2307\/2986146","journal-title":"Appl. Stat."},{"key":"9430_CR52","volume-title":"Applied Statistics and Probability for Engineers","author":"DC Montgomery","year":"2010","unstructured":"D.C. Montgomery, G.C. Runger, Applied Statistics and Probability for Engineers (Wiley, Hoboken, 2010)"},{"key":"9430_CR53","first-page":"0470387378","volume-title":"Nonparametric Statistical Methods","author":"M Hollander","year":"2013","unstructured":"M. Hollander, E. Chicken, D. Wolfe, Nonparametric Statistical Methods (Wiley, Hoboken, 2013), p. 0470387378"},{"key":"9430_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106027","volume":"88","author":"C Doerr","year":"2020","unstructured":"C. Doerr, F. Ye, N. Horesh, H. Wang, O.M. Shir, T. Back, Benchmarking discrete optimization heuristics with iohprofiler. Appl. Soft Comput. 88, 106027 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2019.106027","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"9430_CR55","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"G.R. Harik, F.G. Lobo, D.E. Goldberg, The compact genetic algorithm. IEEE Trans. Evol. Comput. 3(4), 287\u2013297 (1999). https:\/\/doi.org\/10.1109\/4235.797971","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9430_CR56","doi-asserted-by":"publisher","unstructured":"X. Li, K. Deb, Comparing lbest pso niching algorithms using different position update rules, in IEEE Congress on Evolutionary Computation (2010), pp. 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2010.5586317","DOI":"10.1109\/CEC.2010.5586317"},{"key":"9430_CR57","doi-asserted-by":"publisher","unstructured":"M. Kronfeld, A. Zell, Towards scalability in niching methods, in IEEE Congress on Evolutionary Computation (2010), pp. 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2010.5585916","DOI":"10.1109\/CEC.2010.5585916"},{"key":"9430_CR58","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.eswa.2017.02.012","volume":"78","author":"A Soares","year":"2017","unstructured":"A. Soares, R. R\u00e2belo, A. Delbem, Optimization based on phylogram analysis. Expert Syst. Appl. 78, 32\u201350 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.02.012","journal-title":"Expert Syst. Appl."},{"key":"9430_CR59","doi-asserted-by":"crossref","unstructured":"D.E Goldberg, A design approach to problem difficulty, in The Design of Innovation (Springer, 2002), pp. 71\u2013100","DOI":"10.1007\/978-1-4757-3643-4_6"},{"issue":"2","key":"9430_CR60","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/3071178.3071347","volume":"81","author":"C Qian","year":"2019","unstructured":"C. Qian, C. Bian, W. Jiang, K. Tang, Running time analysis of the (1+1)-ea for onemax and leadingones under bit-wise noise. Algorithmica 81(2), 749\u2013795 (2019). https:\/\/doi.org\/10.1145\/3071178.3071347","journal-title":"Algorithmica"},{"key":"9430_CR61","doi-asserted-by":"publisher","unstructured":"N. Buskulic, C. Doerr, Maximizing drift is not optimal for solving onemax, in Proceedings of the Genetic and Evolutionary Computation Conference Companion (2019), pp. 425\u2013426. https:\/\/doi.org\/10.1145\/3319619.3321952","DOI":"10.1145\/3319619.3321952"},{"key":"9430_CR62","doi-asserted-by":"publisher","unstructured":"S. Strasser, J.W Sheppard, Evaluating factored evolutionary algorithm performance on binary deceptive functions, in 2017 IEEE Symposium Series on Computational Intelligence (SSCI) (IEEE, 2017), pp. 1\u20138. https:\/\/doi.org\/10.1109\/SSCI.2017.8285227","DOI":"10.1109\/SSCI.2017.8285227"},{"issue":"3","key":"9430_CR63","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10710-007-9024-z","volume":"8","author":"R Tin\u00f3s","year":"2007","unstructured":"R. Tin\u00f3s, S. Yang, A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genet. Program. Evolvable Mach. 8(3), 255\u2013286 (2007). https:\/\/doi.org\/10.1007\/s10710-007-9024-z","journal-title":"Genet. Program. Evolvable Mach."},{"issue":"2","key":"9430_CR64","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10710-011-9149-y","volume":"13","author":"S Shakya","year":"2012","unstructured":"S. Shakya, R. Santana, J.A. Lozano, A markovianity based optimisation algorithm. Genet. Program. Evolvable Mach. 13(2), 159\u2013195 (2012). https:\/\/doi.org\/10.1007\/s10710-011-9149-y","journal-title":"Genet. Program. Evolvable Mach."},{"key":"9430_CR65","unstructured":"Complex Systems Design Lab (CSDL), Comparing Continuous Optimizers (coco) (CSDL, 2021). https:\/\/coco.gforge.inria.fr"},{"key":"9430_CR66","unstructured":"GECCO, Gecco: Genetic and Evolutionary Computation Conference (GECCO, 2021). https:\/\/dl.acm.org\/conference\/gecco"},{"key":"9430_CR67","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.swevo.2018.10.002","volume":"44","author":"M Hellwig","year":"2019","unstructured":"M. Hellwig, H.-G. Beyer, Benchmarking evolutionary algorithms for single objective real-valued constrained optimization\u2014a critical review. Swarm Evol. Comput. 44, 927\u2013944 (2019). https:\/\/doi.org\/10.1016\/j.swevo.2018.10.002","journal-title":"Swarm Evol. Comput."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-022-09430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10710-022-09430-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-022-09430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T12:12:12Z","timestamp":1651666332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10710-022-09430-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,9]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9430"],"URL":"https:\/\/doi.org\/10.1007\/s10710-022-09430-2","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2022,4,9]]},"assertion":[{"value":"21 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":4,"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 interest"}}]}}