{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T17:26:05Z","timestamp":1772731565865,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T00:00:00Z","timestamp":1522886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T00:00:00Z","timestamp":1522886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"First-Class University and the First-Class Discipline","award":["10301-017004011501"],"award-info":[{"award-number":["10301-017004011501"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,5,3]]},"DOI":"10.1007\/s00521-018-3438-9","type":"journal-article","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T07:52:44Z","timestamp":1522914764000},"page":"1435-1443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["RETRACTED ARTICLE: A self-adaptive genetic algorithm with improved mutation mode based on measurement of population diversity"],"prefix":"10.1007","volume":"31","author":[{"given":"Na","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,5]]},"reference":[{"key":"3438_CR1","first-page":"55","volume":"96","author":"NS Choubey","year":"2011","unstructured":"Choubey NS, Kharat MU (2011) Approaches for handling premature convergence in CFG induction using GA. Soft Comput Ind Appl 96:55\u201366","journal-title":"Soft Comput Ind Appl"},{"key":"3438_CR2","doi-asserted-by":"crossref","unstructured":"Potter MA, De Jong KA (1994) A cooperative coevolutionary approach to function optimization. In: Proceedings of the parallel problem solving from Nature-PPSN III, international conference on evolutionary computation. LNCS 866. Springer, Berlin, pp 249\u2013257","DOI":"10.1007\/3-540-58484-6_269"},{"key":"3438_CR3","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in GA. Appl Soft Comput 24:1047\u20131077","journal-title":"Appl Soft Comput"},{"issue":"6","key":"3438_CR4","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TSMCB.2009.2015281","volume":"39","author":"H Wang","year":"2009","unstructured":"Wang H, Yang S, Ip W, Wang D (2009) Adaptive primal\u2013dual genetic algorithms in dynamic environments. IEEE Trans Syst Man Cybern Part B Cybern 39(6):1348\u20131361","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"1","key":"3438_CR5","first-page":"47","volume":"6","author":"SZ Ramadan","year":"2013","unstructured":"Ramadan SZ (2013) Reducing premature convergence problem in genetic algorithm: application on travel salesman problem. Comput Inf Sci 6(1):47\u201357","journal-title":"Comput Inf Sci"},{"issue":"4","key":"3438_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik L, Patnaik M (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656\u2013667","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"4","key":"3438_CR7","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/JSYST.2013.2258747","volume":"7","author":"B Mohammadi Ivatloo","year":"2013","unstructured":"Mohammadi Ivatloo B, Rabiee A, Soroudi A (2013) Nonconvex dynamic economic power dispatch problems solution using hybrid immune-genetic algorithm. IEEE Syst J 7(4):777\u2013785","journal-title":"IEEE Syst J"},{"issue":"3","key":"3438_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ejor.2013.08.021","volume":"233","author":"T Messelis","year":"2014","unstructured":"Messelis T, Causmaecker PD (2014) An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem. Eur J Oper Res 233(3):511\u2013528","journal-title":"Eur J Oper Res"},{"issue":"3","key":"3438_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10732-007-9037-z","volume":"14","author":"E Hamidreza","year":"2008","unstructured":"Hamidreza E, Geiger CD (2008) A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems. J Heuristics 14(3):203\u2013241","journal-title":"J Heuristics"},{"issue":"10","key":"3438_CR10","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202\u20133212","journal-title":"Comput Oper Res"},{"issue":"1","key":"3438_CR11","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TPWRD.2012.2219598","volume":"28","author":"A Arabali","year":"2013","unstructured":"Arabali A, Ghofrani M, Etezadi-Amoli M et al (2013) Genetic-algorithm-based optimization approach for energy management. IEEE Trans Power Deliv 28(1):162\u2013170","journal-title":"IEEE Trans Power Deliv"},{"issue":"5","key":"3438_CR12","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/TCOMM.2011.031611.070610","volume":"59","author":"XM Dai","year":"2011","unstructured":"Dai XM (2011) Allele gene based adaptive genetic algorithm to the code design. IEEE Trans Commun 59(5):1253\u20131258","journal-title":"IEEE Trans Commun"},{"key":"3438_CR13","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ejor.2013.03.005","volume":"229","author":"R Zamani","year":"2013","unstructured":"Zamani R (2013) A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem. Eur J Oper Res 229:552\u2013559","journal-title":"Eur J Oper Res"},{"key":"3438_CR14","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ijpe.2008.11.002","volume":"117","author":"A Lova","year":"2009","unstructured":"Lova A, Tormos P, Cervantes M et al (2009) An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int J Prod Econ 117:302\u2013316","journal-title":"Int J Prod Econ"},{"key":"3438_CR15","doi-asserted-by":"crossref","unstructured":"Uzor CJ, Gongora M, Coupland S, Passow BN (2014) Real-world dynamic optimization using an adaptive-mutation compact genetic algorithm. In: Proceedings of 2014 IEEE symposium on computational intelligence in dynamic and uncertain environments (CIDUE), pp 17\u201323","DOI":"10.1109\/CIDUE.2014.7007862"},{"issue":"5","key":"3438_CR16","doi-asserted-by":"publisher","first-page":"978","DOI":"10.3724\/SP.J.1001.2010.03484","volume":"21","author":"H Chen","year":"2010","unstructured":"Chen H, Cui DW, Cui YA et al (2010) Ethnic group evolution algorithm. J Softw 21(5):978\u2013990","journal-title":"J Softw"},{"issue":"9","key":"3438_CR17","first-page":"917","volume":"24","author":"Zhang Ling","year":"2001","unstructured":"Ling Zhang, Bo Zhang (2001) Good point set based genetic algorithm. Chin J Comput 24(9):917\u2013922","journal-title":"Chin J Comput"},{"issue":"7","key":"3438_CR18","first-page":"1294","volume":"34","author":"W Meng","year":"2006","unstructured":"Meng W, Han X, Hong B (2006) Bee evolutionary genetic algorithm. Acta Electron Sin 34(7):1294\u20131300","journal-title":"Acta Electron Sin"},{"issue":"6","key":"3438_CR19","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.3724\/SP.J.1001.2010.03592","volume":"21","author":"ZY Jiang","year":"2010","unstructured":"Jiang ZY, Cai ZX, Wang Y (2010) Hybrid self-adaptive orthogonal genetic algorithm for solving global optimization problems. J Softw 21(6):1296\u20131307","journal-title":"J Softw"},{"key":"3438_CR20","doi-asserted-by":"crossref","unstructured":"Danoy G, Bouvry P, Martins T (2006) Hlcga: a hybrid competitive coevolutionary genetic algorithm. In: Proceedings of the 6th international conference on hybrid intelligent systems. Computer Society Press, pp 48\u201351","DOI":"10.1109\/HIS.2006.264931"},{"key":"3438_CR21","doi-asserted-by":"crossref","unstructured":"Zhou Q, Luo WJ (2010) A novel multi-population genetic algorithm for multiple-choice multidimensional knapsack problems. In: Proceedings of the 5th international symposium on advances in computation and intelligence. Springer, Berlin, pp 148\u2013157","DOI":"10.1007\/978-3-642-16493-4_16"},{"issue":"4","key":"3438_CR22","doi-asserted-by":"publisher","first-page":"765","DOI":"10.3724\/SP.J.1001.2012.04040","volume":"23","author":"Q Liu","year":"2012","unstructured":"Liu Q, Wang X, Fu Q et al (2012) Double elite coevolutionary genetic algorithm. J Softw 23(4):765\u2013775","journal-title":"J Softw"},{"issue":"10","key":"3438_CR23","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1016\/j.spl.2013.05.025","volume":"83","author":"JA Rojas Cruz","year":"2013","unstructured":"Rojas Cruz JA, Pereira AGC (2013) The elitist nonhomogeneous genetic algorithm: almost sure convergence. Stat Probab Lett 83(10):2179\u20132185","journal-title":"Stat Probab Lett"},{"issue":"57","key":"3438_CR24","first-page":"185","volume":"57","author":"VEM Campos","year":"2013","unstructured":"Campos VEM, Pereira AGC (2013) Modeling the genetic algorithm by a non-homogeneous Markov chain: weak and strong ergodicity. Theory Probab Appl 57(57):185\u2013192","journal-title":"Theory Probab Appl"},{"key":"3438_CR25","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00180-010-0197-1","volume":"25","author":"J Hallam","year":"2010","unstructured":"Hallam J, Akman O, Akman F (2010) Genetic algorithms with shrinking population size. Comput Stat 25:691\u2013705","journal-title":"Comput Stat"},{"issue":"1","key":"3438_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00180-014-0526-x","volume":"30","author":"AGC Pereira","year":"2015","unstructured":"Pereira AGC, Andrade BBD (2015) On the genetic algorithm with adaptive mutation rate and selected statistical applications. Comput Stat 30(1):131\u2013150","journal-title":"Comput Stat"},{"key":"3438_CR27","first-page":"1687","volume":"2012","author":"M Jalali Varnamkhasti","year":"2015","unstructured":"Jalali Varnamkhasti M, Lee LS, Bakar A (2015) A genetic algorithm with fuzzy crossover operator and probability. Adv Oper Res 2012:1687\u20139147","journal-title":"Adv Oper Res"},{"issue":"5","key":"3438_CR28","doi-asserted-by":"publisher","first-page":"2759","DOI":"10.1016\/j.asoc.2012.11.011","volume":"13","author":"SS Sathya","year":"2013","unstructured":"Sathya SS, Radhika MV (2013) Convergence of nomadic genetic algorithm on benchmark mathematical functions. Appl Soft Comput 13(5):2759\u20132766","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3438_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10015-008-0545-1","volume":"13","author":"S-M Im","year":"2008","unstructured":"Im S-M, Lee J-J (2008) Adaptive crossover, mutation and selection using fuzzy system for genetic algorithms. Artif Life Robot 13(1):129\u2013133","journal-title":"Artif Life Robot"},{"issue":"3","key":"3438_CR30","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s11128-013-0686-6","volume":"13","author":"A Saitoh","year":"2014","unstructured":"Saitoh A, Rahimi R, Nakahara M (2014) A quantum genetic algorithm with quantum crossover and mutation operations. Quantum Inf Process 13(3):737\u2013755","journal-title":"Quantum Inf Process"},{"key":"3438_CR31","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S Hartmann","year":"2002","unstructured":"Hartmann S (2002) Project scheduling with multiple modes: a genetic algorithm. Naval Res Logist 49:433\u2013448","journal-title":"Naval Res Logist"}],"updated-by":[{"DOI":"10.1007\/s00521-024-10081-w","type":"retraction","label":"Retraction","source":"publisher","updated":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:00:00Z","timestamp":1721001600000}}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3438-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-018-3438-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3438-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T11:05:55Z","timestamp":1721041555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-018-3438-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,5]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5,3]]}},"alternative-id":["3438"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3438-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,5]]},"assertion":[{"value":"8 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This article has been retracted. Please see the Retraction Notice for more detail:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00521-024-10081-w","URL":"https:\/\/doi.org\/10.1007\/s00521-024-10081-w","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}