{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:10:55Z","timestamp":1753272655649,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The canonical estimation of distribution algorithm (EDA) easily falls into a local optimum with an ill-shaped population distribution, which leads to weak convergence performance and less stability when solving global optimization problems. To overcome this defect, we explore a novel EDA variant with an ensemble of three distribution modification strategies, i.e., archive-based population updating (APU), multileader-based search diversification (MSD), and the triggered distribution shrinkage (TDS) strategy, named E<jats:sub>3<\/jats:sub>-EDA. The APU strategy utilizes historical population information to rebuild the search scope and avoid ill-shaped distributions. Moreover, it continuously updates the archive to avoid overfitting the distribution model. The MSD makes full use of the location differences among populations to evolve the sampling toward promising regions. TDS is triggered when the search stagnates, shrinking the distribution scope to achieve local exploitation. Additionally, the E<jats:sub>3<\/jats:sub>-EDA performance is evaluated using the CEC 2014 and CEC 2018 test suites on 10-dimensional, 30-dimensional, 50-dimensional and 100-dimensional problems. Moreover, several prominent EDA variants and other top methods from CEC competitions are comprehensively compared with the proposed method. The competitive performance of E<jats:sub>3<\/jats:sub>-EDA in solving complex problems is supported by the nonparametric test results.<\/jats:p>","DOI":"10.1007\/s40747-023-00975-y","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T13:03:25Z","timestamp":1679317405000},"page":"5377-5416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A novel ensemble estimation of distribution algorithm with distribution modification strategies"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaofei","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5304-5147","authenticated-orcid":false,"given":"Yintong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yajun","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Bi","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yongbo","family":"Xuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,20]]},"reference":[{"key":"975_CR1","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga P, Lozano JA (2002) Estimation of distribution algorithms: a new tool for evolutionary computation","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"975_CR2","doi-asserted-by":"publisher","first-page":"107255","DOI":"10.1016\/j.knosys.2021.107255","volume":"228","author":"C Wu","year":"2021","unstructured":"Wu C, Wang L, Wang J (2021) A path relinking enhanced estimation of distribution algorithm for direct acyclic graph task scheduling problem. Knowl Based Syst 228:107255. https:\/\/doi.org\/10.1016\/j.knosys.2021.107255","journal-title":"Knowl Based Syst"},{"key":"975_CR3","doi-asserted-by":"crossref","unstructured":"Wang Y, Li B (2008) A restart univariate estimation of distribution algorithm: Sampling under mixed Gaussian and L\u00e9vy probability distribution. In: 2008 IEEE congress on evolutionary computation, CEC 2008. IEEE, pp 3917\u20133924","DOI":"10.1109\/CEC.2008.4631330"},{"key":"975_CR4","unstructured":"De Bonet JS, Isbell CL, Viola P (1997) MIMIC: finding optima by estimating probability densities. In: Advances in neural information processing systems, pp 424\u2013430"},{"key":"975_CR5","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/TCYB.2016.2523000","volume":"47","author":"Q Yang","year":"2017","unstructured":"Yang Q, Chen WN, Li Y et al (2017) Multimodal estimation of distribution algorithms. IEEE Trans Cybern 47:636\u2013650. https:\/\/doi.org\/10.1109\/TCYB.2016.2523000","journal-title":"IEEE Trans Cybern"},{"key":"975_CR6","doi-asserted-by":"publisher","unstructured":"Srikamdee S, Chongstitvatana P (2020) Collaborative learning of estimation of distribution algorithms for RNA secondary structure prediction. ECTI Trans Comput Inf Technol 14:92\u2013102. https:\/\/doi.org\/10.37936\/ecti-cit.2020141.239871","DOI":"10.37936\/ecti-cit.2020141.239871"},{"key":"975_CR7","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.asej.2020.07.034","volume":"12","author":"B Pratap Chandran","year":"2021","unstructured":"Pratap Chandran B, Immanuel Selvakumar A, Shine Let G, Paul Sathiyan S (2021) Optimal model parameter estimation of solar and fuel cells using improved estimation of distribution algorithm. Ain Shams Eng J 12:1693\u20131700. https:\/\/doi.org\/10.1016\/j.asej.2020.07.034","journal-title":"Ain Shams Eng J"},{"key":"975_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.matcom.2021.03.017","volume":"187","author":"ZG Arenas","year":"2021","unstructured":"Arenas ZG, Jimenez JC, Lozada-Chang LV, Santana R (2021) Estimation of distribution algorithms for the computation of innovation estimators of diffusion processes. Math Comput Simul 187:449\u2013467. https:\/\/doi.org\/10.1016\/j.matcom.2021.03.017","journal-title":"Math Comput Simul"},{"key":"975_CR9","doi-asserted-by":"publisher","unstructured":"Du Y, Li J, Luo C, Meng L (2021) A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations. Swarm Evol Comput 62:100861. https:\/\/doi.org\/10.1016\/j.swevo.2021.100861","DOI":"10.1016\/j.swevo.2021.100861"},{"key":"975_CR10","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TETCI.2020.3013652","volume":"5","author":"W Shi","year":"2021","unstructured":"Shi W, Chen WN, Gu T et al (2021) Handling uncertainty in financial decision making: a clustering estimation of distribution algorithm with simplified simulation. IEEE Trans Emerg Top Comput Intell 5:42\u201356. https:\/\/doi.org\/10.1109\/TETCI.2020.3013652","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"975_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.knosys.2018.02.001","volume":"146","author":"Z Ren","year":"2018","unstructured":"Ren Z, Liang Y, Wang L et al (2018) Anisotropic adaptive variance scaling for Gaussian estimation of distribution algorithm. Knowl Based Syst 146:142\u2013151. https:\/\/doi.org\/10.1016\/j.knosys.2018.02.001","journal-title":"Knowl Based Syst"},{"key":"975_CR12","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TCYB.2018.2869567","volume":"50","author":"Y Liang","year":"2020","unstructured":"Liang Y, Ren Z, Yao X et al (2020) Enhancing Gaussian estimation of distribution algorithm by exploiting evolution direction with archive. IEEE Trans Cybern 50:140\u2013152. https:\/\/doi.org\/10.1109\/TCYB.2018.2869567","journal-title":"IEEE Trans Cybern"},{"key":"975_CR13","doi-asserted-by":"crossref","unstructured":"Zhang G, Shi Y (2018) Hybrid sampling evolution strategy for solving single objective bound constrained problems. In: 2018 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20137","DOI":"10.1109\/CEC.2018.8477908"},{"key":"975_CR14","doi-asserted-by":"crossref","unstructured":"Hadi AA, Mohamed AW, Jambi KM (2021) Single-objective real-parameter optimization: enhanced LSHADE-SPACMA algorithm. In: Studies in computational intelligence, pp 103\u2013121","DOI":"10.1007\/978-3-030-58930-1_7"},{"key":"975_CR15","doi-asserted-by":"crossref","unstructured":"Kumar A, Misra RK, Singh D (2017) Improving the local search capability of effective butterfly optimizer using covariance matrix adapted retreat phase. In: 2017 IEEE congress on evolutionary computation, CEC 2017\u2014Proceedings. IEEE, pp 1835\u20131842","DOI":"10.1109\/CEC.2017.7969524"},{"key":"975_CR16","doi-asserted-by":"crossref","unstructured":"Elsayed S, Hamza N, Sarker R (2016) Testing united multi-operator evolutionary algorithms-II on single objective optimization problems. In: 2016 IEEE congress on evolutionary computation, CEC 2016. IEEE, pp 2966\u20132973","DOI":"10.1109\/CEC.2016.7744164"},{"key":"975_CR17","doi-asserted-by":"crossref","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, pp 2958\u20132965","DOI":"10.1109\/CEC.2016.7744163"},{"key":"975_CR18","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga AS (2014) Improving the search performance of SHADE using linear population size reduction. In: Proceedings of the 2014 IEEE congress on evolutionary computation, CEC 2014, pp 1658\u20131665","DOI":"10.1109\/CEC.2014.6900380"},{"key":"975_CR19","doi-asserted-by":"crossref","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 2018\u2014Proceedings. IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477977"},{"key":"975_CR20","doi-asserted-by":"publisher","first-page":"37383","DOI":"10.1109\/ACCESS.2020.2975468","volume":"8","author":"X Wang","year":"2020","unstructured":"Wang X, Han T, Zhao H (2020) An estimation of distribution algorithm with multi-leader search. IEEE Access 8:37383\u201337405. https:\/\/doi.org\/10.1109\/ACCESS.2020.2975468","journal-title":"IEEE Access"},{"key":"975_CR21","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.3390\/math9243207","volume":"9","author":"Q Yang","year":"2021","unstructured":"Yang Q, Li Y, Gao X-D et al (2021) An adaptive covariance scaling estimation of distribution algorithm. Mathematics 9:3207. https:\/\/doi.org\/10.3390\/math9243207","journal-title":"Mathematics"},{"key":"975_CR22","doi-asserted-by":"crossref","unstructured":"Cai Y, Sun X, Xu H, Jia P (2007) Cross entropy and adaptive variance scaling in continuous EDA. In: Proceedings of GECCO 2007: genetic and evolutionary computation conference. ACM Press, New York, pp 609\u2013616","DOI":"10.1145\/1276958.1277081"},{"key":"975_CR23","doi-asserted-by":"crossref","unstructured":"Grahl J, Bosman PAN, Rothlauf F (2006) The correlation-triggered adaptive variance scaling IDEA. In: GECCO 2006\u2014genetic and evolutionary computation conference. ACM Press, New York, pp 397\u2013404","DOI":"10.1145\/1143997.1144071"},{"key":"975_CR24","doi-asserted-by":"crossref","unstructured":"Bosman PAN, Grahl J, Rothlauf F (2007) SDR: a better trigger for adaptive variance scaling in normal EDAs. In: Proceedings of GECCO 2007: genetic and evolutionary computation conference, pp 492\u2013499","DOI":"10.1145\/1276958.1277066"},{"key":"975_CR25","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1162\/EVCO_a_00094","volume":"21","author":"PAN Bosman","year":"2013","unstructured":"Bosman PAN, Grahl J, Thierens D (2013) Benchmarking parameter-free AMaLGaM on functions with and without noise. Evol Comput 21:455\u2013469. https:\/\/doi.org\/10.1162\/EVCO_a_00094","journal-title":"Evol Comput"},{"key":"975_CR26","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen N, Ostermeier A (2001) Completely derandomized self-adaptation in evolution strategies. Evol Comput 9:159\u2013195","journal-title":"Evol Comput"},{"key":"975_CR27","doi-asserted-by":"crossref","unstructured":"Auger A, Hansen N (2005) A restart CMA evolution strategy with increasing population size. In: 2005 IEEE congress on evolutionary computation, IEEE CEC 2005. Proceedings. IEEE, pp 1769\u20131776","DOI":"10.1109\/CEC.2005.1554902"},{"key":"975_CR28","doi-asserted-by":"crossref","unstructured":"Loshchilov I (2013) CMA-ES with restarts for solving CEC 2013 benchmark problems. In: 2013 IEEE congress on evolutionary computation, CEC 2013, pp 369\u2013376","DOI":"10.1109\/CEC.2013.6557593"},{"key":"975_CR29","doi-asserted-by":"publisher","first-page":"866","DOI":"10.3390\/mca15050866","volume":"15","author":"X Huang","year":"2010","unstructured":"Huang X, Jia P, Liu B (2010) Controlling chaos by an improved estimation of distribution algorithm. Math Comput Appl 15:866\u2013871. https:\/\/doi.org\/10.3390\/mca15050866","journal-title":"Math Comput Appl"},{"key":"975_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/09540090701725524","volume":"19","author":"T Miqu\u00e9lez","year":"2007","unstructured":"Miqu\u00e9lez T, Bengoetxea E, Mendiburu A, Larra\u00f1aga P (2007) Combining Bayesian classifiers and estimation of distribution algorithms for optimization in continuous domains. Connect Sci 19:297\u2013319. https:\/\/doi.org\/10.1080\/09540090701725524","journal-title":"Connect Sci"},{"key":"975_CR31","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1016\/j.asoc.2012.11.049","volume":"13","author":"H Karshenas","year":"2013","unstructured":"Karshenas H, Santana R, Bielza C, Larra\u00f1aga P (2013) Regularized continuous estimation of distribution algorithms. Appl Soft Comput J 13:2412\u20132432. https:\/\/doi.org\/10.1016\/j.asoc.2012.11.049","journal-title":"Appl Soft Comput J"},{"key":"975_CR32","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.asoc.2017.08.037","volume":"61","author":"B Qian","year":"2017","unstructured":"Qian B, Li Z, Hu R (2017) A copula-based hybrid estimation of distribution algorithm for m-machine reentrant permutation flow-shop scheduling problem. Appl Soft Comput 61:921\u2013934. https:\/\/doi.org\/10.1016\/j.asoc.2017.08.037","journal-title":"Appl Soft Comput"},{"key":"975_CR33","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.asoc.2017.04.066","volume":"58","author":"L PourMohammadBagher","year":"2017","unstructured":"PourMohammadBagher L, Ebadzadeh MM, Safabakhsh R (2017) Graphical model based continuous estimation of distribution algorithm. Appl Soft Comput 58:388\u2013400. https:\/\/doi.org\/10.1016\/j.asoc.2017.04.066","journal-title":"Appl Soft Comput"},{"key":"975_CR34","doi-asserted-by":"publisher","first-page":"43298","DOI":"10.1109\/ACCESS.2019.2908262","volume":"7","author":"X Wang","year":"2019","unstructured":"Wang X, Zhao H, Han T et al (2019) A Gaussian estimation of distribution algorithm with random walk strategies and its application in optimal missile guidance handover for multi-UCAV in over-the-horizon air combat. IEEE Access 7:43298\u201343317. https:\/\/doi.org\/10.1109\/ACCESS.2019.2908262","journal-title":"IEEE Access"},{"key":"975_CR35","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TEVC.2016.2638437","volume":"21","author":"X Li","year":"2017","unstructured":"Li X, Epitropakis MG, Deb K, Engelbrecht A (2017) Seeking multiple solutions: an updated survey on niching methods and their applications. IEEE Trans Evol Comput 21:518\u2013538. https:\/\/doi.org\/10.1109\/TEVC.2016.2638437","journal-title":"IEEE Trans Evol Comput"},{"key":"975_CR36","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11783-015-0776-z","volume":"10","author":"X Qi","year":"2016","unstructured":"Qi X, Li K, Potter WD (2016) Estimation of distribution algorithm enhanced particle swarm optimization for water distribution network optimization. Front Environ Sci Eng 10:341\u2013351. https:\/\/doi.org\/10.1007\/s11783-015-0776-z","journal-title":"Front Environ Sci Eng"},{"key":"975_CR37","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1080\/00207543.2015.1041575","volume":"54","author":"F Zhao","year":"2016","unstructured":"Zhao F, Shao Z, Wang J, Zhang C (2016) A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems. Int J Prod Res 54:1039\u20131060. https:\/\/doi.org\/10.1080\/00207543.2015.1041575","journal-title":"Int J Prod Res"},{"key":"975_CR38","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s40314-015-0237-0","volume":"36","author":"F Zhao","year":"2017","unstructured":"Zhao F, Shao Z, Wang J, Zhang C (2017) A hybrid optimization algorithm based on chaotic differential evolution and estimation of distribution. Comput Appl Math 36:433\u2013458. https:\/\/doi.org\/10.1007\/s40314-015-0237-0","journal-title":"Comput Appl Math"},{"key":"975_CR39","doi-asserted-by":"publisher","first-page":"953","DOI":"10.3390\/su9060953","volume":"9","author":"Z Sun","year":"2017","unstructured":"Sun Z, Gu X (2017) Hybrid algorithm based on an estimation of distribution algorithm and cuckoo search for the no idle permutation flow shop scheduling problem with the total tardiness criterion minimization. Sustainability 9:953. https:\/\/doi.org\/10.3390\/su9060953","journal-title":"Sustainability"},{"key":"975_CR40","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TCYB.2018.2802912","volume":"49","author":"ZZ Liu","year":"2019","unstructured":"Liu ZZ, Wang Y, Yang S, Tang K (2019) An adaptive framework to tune the coordinate systems in nature-inspired optimization algorithms. IEEE Trans Cybern 49:1403\u20131416. https:\/\/doi.org\/10.1109\/TCYB.2018.2802912","journal-title":"IEEE Trans Cybern"},{"key":"975_CR41","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.asoc.2014.01.038","volume":"18","author":"Y Wang","year":"2014","unstructured":"Wang Y, Li H-X, Huang T, Li L (2014) Differential evolution based on covariance matrix learning and bimodal distribution parameter setting. Appl Soft Comput 18:232\u2013247. https:\/\/doi.org\/10.1016\/j.asoc.2014.01.038","journal-title":"Appl Soft Comput"},{"key":"975_CR42","unstructured":"Awad NH, Ali MZ, Liang J et al (2016) Problem definitions and evaluation criteria for the CEC 2017 special session and competition on real-parameter optimization"},{"key":"975_CR43","unstructured":"Mallipeddi RPNSGW (2010) Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-00975-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-00975-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-00975-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T17:19:31Z","timestamp":1695403171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-00975-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,20]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["975"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-00975-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2023,3,20]]},"assertion":[{"value":"19 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}