{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:08:15Z","timestamp":1775671695894,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"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":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Diverse mutant vectors play a significant role in the performance of the Differential Evolution (DE). A mutant vector is generated using a stochastic mathematical equation, known as mutation strategy. Many mutation strategies have been proposed in the literature. Utilizing multiple mutation strategies with the help of an adaptive operator selection (AOS) technique can improve the quality of the mutant vector. In this research, one popular AOS technique known as perturbation adaptive pursuit (PAP) is integrated with the DE algorithm for managing a pool of mutation strategies. A community-based reward criterion is proposed that rewards the cumulative performance of the whole population. The proposed approach is called \u2018<jats:italic>Dynamic Mutation Strategy Selection in Differential Evolution using Perturbed Adaptive Pursuit (dmss-DE-pap)<\/jats:italic>\u2019. The performance of dmss-DE-pap is evaluated over the 30D and 50D optimization problems of the CEC 2014 benchmark test suite. Results are competitive when compared with other state-of-the-art evolutionary algorithms and some recent DE variants.<\/jats:p>","DOI":"10.1007\/s42979-024-03062-2","type":"journal-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T06:03:09Z","timestamp":1723096989000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Mutation Strategy Selection in Differential Evolution Using Perturbed Adaptive Pursuit"],"prefix":"10.1007","volume":"5","author":[{"given":"Prathu","family":"Bajpai","sequence":"first","affiliation":[]},{"given":"Ogbonnaya","family":"Anicho","sequence":"additional","affiliation":[]},{"given":"Atulya K.","family":"Nagar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9029-5129","authenticated-orcid":false,"given":"Jagdish Chand","family":"Bansal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,8]]},"reference":[{"issue":"4","key":"3062_CR1","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/0360-8352(96)00037-X","volume":"30","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Dasgupta D, Le Riche RG, Schoenauer M. Evolutionary algorithms for constrained engineering problems. Comput Ind Eng. 1996;30(4):851\u201370.","journal-title":"Comput Ind Eng"},{"issue":"1\u20133","key":"3062_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2003.03.013","volume":"163","author":"DR Carvalho","year":"2004","unstructured":"Carvalho DR, Freitas AA. A hybrid decision tree\/genetic algorithm method for data mining. Inf Sci. 2004;163(1\u20133):13\u201335.","journal-title":"Inf Sci"},{"key":"3062_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ecolmodel.2018.11.013","volume":"392","author":"S Gobeyn","year":"2019","unstructured":"Gobeyn S, Mouton AM, Cord AF, Kaim A, Volk M, Goethals PL. Evolutionary algorithms for species distribution modelling: a review in the context of machine learning. Ecol Model. 2019;392:179\u201395.","journal-title":"Ecol Model"},{"key":"3062_CR4","unstructured":"Simon, D. Evolutionary optimization algorithms. John Wiley & Sons, 2013."},{"key":"3062_CR5","unstructured":"Nocedal J, Wright S. Numerical optimization. Springer Science and Business Media. 2006."},{"issue":"1","key":"3062_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck T, Schwefel H-P. An overview of evolutionary algorithms for parameter optimization. Evol Comput. 1993;1(1):1\u201323.","journal-title":"Evol Comput"},{"key":"3062_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2014.06.009","volume":"289","author":"J Derrac","year":"2014","unstructured":"Derrac J, Garc\u00eda S, Hui S, Suganthan PN, Herrera F. Analyzing convergence performance of evolutionary algorithms: a statistical approach. Inf Sci. 2014;289:41\u201358.","journal-title":"Inf Sci"},{"key":"3062_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. A simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim. 1997;11:341\u201359.","journal-title":"J Glob Optim"},{"key":"3062_CR9","doi-asserted-by":"crossref","unstructured":"Slowik A, Bialko M. Training of artificial neural networks using differential evolution algorithm. In: 2008 Conference on human system interactions, 2008;pp. 60\u201365. IEEE","DOI":"10.1109\/HSI.2008.4581409"},{"issue":"2","key":"3062_CR10","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2004.08.043","volume":"171","author":"G Onwubolu","year":"2006","unstructured":"Onwubolu G, Davendra D. Scheduling flow shops using differential evolution algorithm. Eur J Oper Res. 2006;171(2):674\u201392.","journal-title":"Eur J Oper Res"},{"key":"3062_CR11","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1016\/j.rser.2017.03.097","volume":"77","author":"L Jebaraj","year":"2017","unstructured":"Jebaraj L, Venkatesan C, Soubache I, Rajan CCA. Application of differential evolution algorithm in static and dynamic economic or emission dispatch problem: a review. Renew Sustain Energy Rev. 2017;77:1206\u201320.","journal-title":"Renew Sustain Energy Rev"},{"issue":"1","key":"3062_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2010","unstructured":"Das S, Suganthan PN. Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput. 2010;15(1):4\u201331.","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"3062_CR13","first-page":"293","volume":"10","author":"R G\u00e4mperle","year":"2002","unstructured":"G\u00e4mperle R, M\u00fcller SD, Koumoutsakos P. A parameter study for differential evolution. Adv intell Syst Fuzzy Syst Evol Comput. 2002;10(10):293\u20138.","journal-title":"Adv intell Syst Fuzzy Syst Evol Comput"},{"key":"3062_CR14","unstructured":"Zaharie D. Control of population diversity and adaptation in differential evolution algorithms. Proc of MENDEL. 2003;9:41\u20136."},{"key":"3062_CR15","doi-asserted-by":"crossref","unstructured":"Das S, Konar A, Chakraborty UK. Two improved differential evolution schemes for faster global search. In: Proceedings of the 7th annual Conference on Genetic and Evolutionary Computation, 2005;pp. 991\u2013998.","DOI":"10.1145\/1068009.1068177"},{"issue":"2","key":"3062_CR16","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. Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput. 2008;13(2):398\u2013417.","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"3062_CR17","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1016\/j.asoc.2010.04.024","volume":"11","author":"R Mallipeddi","year":"2011","unstructured":"Mallipeddi R, Suganthan PN, Pan Q-K, Tasgetiren MF. Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl Soft Comput. 2011;11(2):1679\u201396.","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3062_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TEVC.2010.2087271","volume":"15","author":"Y Wang","year":"2011","unstructured":"Wang Y, Cai Z, Zhang Q. Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput. 2011;15(1):55\u201366.","journal-title":"IEEE Trans Evol Comput"},{"key":"3062_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.ins.2015.09.009","volume":"329","author":"G Wu","year":"2016","unstructured":"Wu G, Mallipeddi R, Suganthan PN, Wang R, Chen H. Differential evolution with multi-population based ensemble of mutation strategies. Inf Sci. 2016;329:329\u201345.","journal-title":"Inf Sci"},{"key":"3062_CR20","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ins.2017.09.053","volume":"423","author":"G Wu","year":"2018","unstructured":"Wu G, Shen X, Li H, Chen H, Lin A, Suganthan PN. Ensemble of differential evolution variants. Inf Sci. 2018;423:172\u201386.","journal-title":"Inf Sci"},{"key":"3062_CR21","doi-asserted-by":"publisher","first-page":"3612","DOI":"10.1007\/s10489-018-1153-y","volume":"48","author":"W Qian","year":"2018","unstructured":"Qian W, Chai J, Xu Z, Zhang Z. Differential evolution algorithm with multiple mutation strategies based on roulette wheel selection. Appl Intell. 2018;48:3612\u201329.","journal-title":"Appl Intell"},{"key":"3062_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113451","volume":"153","author":"Y Li","year":"2020","unstructured":"Li Y, Wang S, Yang B. An improved differential evolution algorithm with dual mutation strategies collaboration. Expert Syst Appl. 2020;153: 113451.","journal-title":"Expert Syst Appl"},{"key":"3062_CR23","doi-asserted-by":"publisher","first-page":"5277","DOI":"10.1007\/s00500-020-05527-x","volume":"25","author":"W Deng","year":"2021","unstructured":"Deng W, Shang S, Cai X, Zhao H, Song Y, Xu J. An improved differential evolution algorithm and its application in optimization problem. Soft Comput. 2021;25:5277\u201398.","journal-title":"Soft Comput"},{"key":"3062_CR24","unstructured":"Lampinen J, Zelinka I, et al. On stagnation of the differential evolution algorithm. In: Proceedings of MENDEL, 2000;vol. 6, pp. 76\u201383. Citeseer."},{"key":"3062_CR25","doi-asserted-by":"crossref","unstructured":"Thierens D. An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 7th annual conference on genetic and evolutionary computation, 2005;pp. 1539\u20131546.","DOI":"10.1145\/1068009.1068251"},{"issue":"24","key":"3062_CR26","doi-asserted-by":"publisher","first-page":"5364","DOI":"10.1016\/j.ins.2011.07.049","volume":"181","author":"W Gong","year":"2011","unstructured":"Gong W, Fialho \u00c1, Cai Z, Li H. Adaptive strategy selection in differential evolution for numerical optimization: an empirical study. Inf Sci. 2011;181(24):5364\u201386.","journal-title":"Inf Sci"},{"key":"3062_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF00116878","volume":"5","author":"DE Goldberg","year":"1990","unstructured":"Goldberg DE. Probability matching, the magnitude of reinforcement, and classifier system bidding. Mach Learn. 1990;5:407\u201325.","journal-title":"Mach Learn"},{"key":"3062_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100647","volume":"54","author":"S Zhang","year":"2020","unstructured":"Zhang S, Ren Z, Li C, Xuan J. A perturbation adaptive pursuit strategy based hyper-heuristic for multi-objective optimization problems. Swarm Evol Comput. 2020;54: 100647.","journal-title":"Swarm Evol Comput"},{"key":"3062_CR29","doi-asserted-by":"crossref","unstructured":"Thierens D. Adaptive strategies for operator allocation. Parameter setting in evolutionary algorithms, 77\u201390, 2007.","DOI":"10.1007\/978-3-540-69432-8_4"},{"key":"3062_CR30","doi-asserted-by":"crossref","unstructured":"Mousavirad SJ, Rahnamayan S. Enhancing shade and l-shade algorithms using ordered mutation. In: 2020 IEEE symposium series on computational intelligence (SSCI), 2020;pp. 337\u2013344. IEEE","DOI":"10.1109\/SSCI47803.2020.9308550"},{"key":"3062_CR31","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga AS. Improving the search performance of shade using linear population size reduction. In: 2014 IEEE congress on evolutionary computation (CEC), 2014;pp. 1658\u20131665. IEEE","DOI":"10.1109\/CEC.2014.6900380"},{"key":"3062_CR32","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga A. Success-history based parameter adaptation for differential evolution. In: 2013 IEEE congress on evolutionary computation, 2013;pp. 71\u201378. IEEE","DOI":"10.1109\/CEC.2013.6557555"},{"key":"3062_CR33","unstructured":"Liang JJ, Qu BY, Suganthan PN. Problem definitions and evaluation criteria for the cec 2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore 2013;635(2)."},{"key":"3062_CR34","first-page":"108","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B. A comparative study of artificial bee colony algorithm, applied mathematics and computation. Appl Math Comput. 2009;214:108\u201332.","journal-title":"Appl Math Comput"},{"key":"3062_CR35","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R. Particle swarm optimization. Proc IEEE Int Conf Neural Netw. 1995;4:1942\u20138.","journal-title":"Proc IEEE Int Conf Neural Netw"},{"key":"3062_CR36","unstructured":"Hansen N, Ostermeier A. Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE international conference on evolutionary computation, 1996;pp. 312\u2013317. IEEE"},{"key":"3062_CR37","doi-asserted-by":"crossref","unstructured":"Brest J, Mau\u010dec MS, Bo\u0161kovi\u0107 B. il-shade: Improved l-shade algorithm for single objective real-parameter optimization. In: 2016 IEEE congress on evolutionary computation (CEC), 2016;pp. 1188\u20131195. IEEE","DOI":"10.1109\/CEC.2016.7743922"},{"key":"3062_CR38","doi-asserted-by":"crossref","unstructured":"Brest J, Mau\u010dec MS, Bo\u0161kovi\u0107 B. Single objective real-parameter optimization: Algorithm jso. In: 2017 IEEE congress on evolutionary computation (CEC), 2017;pp. 1311\u20131318. IEEE","DOI":"10.1109\/CEC.2017.7969456"},{"issue":"4","key":"3062_CR39","doi-asserted-by":"publisher","first-page":"242","DOI":"10.20982\/tqmp.14.4.p242","volume":"14","author":"J-C Goulet-Pelletier","year":"2018","unstructured":"Goulet-Pelletier J-C, Cousineau D. A review of effect sizes and their confidence intervals, part I: the cohen\u2019sd family. Quant Methods Psychol. 2018;14(4):242\u201365.","journal-title":"Quant Methods Psychol"},{"key":"3062_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100671","volume":"54","author":"B Morales-Casta\u00f1eda","year":"2020","unstructured":"Morales-Casta\u00f1eda B, Zaldivar D, Cuevas E, Fausto F, Rodr\u00edguez A. A better balance in metaheuristic algorithms: does it exist? Swarm Evol Comput. 2020;54: 100671.","journal-title":"Swarm Evol Comput"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03062-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03062-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03062-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T06:31:37Z","timestamp":1723098697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03062-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,8]]},"references-count":40,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["3062"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03062-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,8]]},"assertion":[{"value":"21 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no Conflict of interest or Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No human\/animal participants are involved in this study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to Participate"}},{"value":"All Authors give their consent for publication of this manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"771"}}