{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T11:04:48Z","timestamp":1779793488870,"version":"3.53.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10489-026-07115-2","type":"journal-article","created":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T08:31:15Z","timestamp":1778747475000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A simple parallel multi-population evolutionary algorithm for analysis"],"prefix":"10.1007","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3232-6183","authenticated-orcid":false,"given":"Tianyi","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,14]]},"reference":[{"issue":"1","key":"7115_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32\u201349","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"7115_CR2","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1007\/s11831-021-09694-4","volume":"29","author":"AG Gad","year":"2022","unstructured":"Gad AG (2022) Particle swarm optimization algorithm and its applications: a systematic review. Arch Comput Methods Eng 29(5):2531\u20132561","journal-title":"Arch Comput Methods Eng"},{"issue":"9","key":"7115_CR3","first-page":"3924","volume":"69","author":"K-D Lu","year":"2022","unstructured":"Lu K-D, Wu Z-G (2022) Multi-objective false data injection attacks of cyber\u2013physical power systems. IEEE Trans Circuits Syst II Express Briefs 69(9):3924\u20133928","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"issue":"4","key":"7115_CR4","doi-asserted-by":"publisher","first-page":"4266","DOI":"10.1109\/TDSC.2025.3545363","volume":"22","author":"K-D Lu","year":"2025","unstructured":"Lu K-D, Huang J-C, Zeng G-Q, Chen M-R, Geng G-G, Weng J (2025) Multi-objective discrete extremal optimization of variable-length blocks-based cnn by joint nas and hpo for intrusion detection in iiot. IEEE Trans Dependable Secure Comput 22(4):4266\u20134283. https:\/\/doi.org\/10.1109\/TDSC.2025.3545363","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"7115_CR5","first-page":"625","volume":"26","author":"O Yilmaz","year":"2019","unstructured":"Yilmaz O, Durmusoglu M (2019) Multi-objective scheduling problem for hybrid manufacturing systems with walking workers. Int J Ind Eng Theory Appl Practice 26:625\u2013650","journal-title":"Int J Ind Eng Theory Appl Practice"},{"key":"7115_CR6","doi-asserted-by":"publisher","first-page":"106967","DOI":"10.1016\/j.cor.2024.106967","volume":"177","author":"GY Beren","year":"2025","unstructured":"Beren GY, Omer FY, Elif A, Emre C (2025) Seru scheduling problem with lot streaming and worker transfers: a multi-objective approach. Comput Oper Res 177:106967","journal-title":"Comput Oper Res"},{"issue":"4","key":"7115_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3472304","volume":"1","author":"B Doerr","year":"2021","unstructured":"Doerr B, Neumann F (2021) A survey on recent progress in the theory of evolutionary algorithms for discrete optimization. ACM Trans Evol Learn Optim 1(4):1\u201343","journal-title":"ACM Trans Evol Learn Optim"},{"key":"7115_CR8","doi-asserted-by":"crossref","unstructured":"Zheng W, Liu Y, Doerr B (2022) A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II). In: Proceedings of the AAAI conference on artificial intelligence, vol 36, pp 10408\u201310416","DOI":"10.1609\/aaai.v36i9.21283"},{"key":"7115_CR9","doi-asserted-by":"crossref","unstructured":"Doerr B, Qu Z (2023) Runtime analysis for the NSGA-II: provable speed-ups from crossover. In: Proceedings of the AAAI conference on artificial intelligence, vol 37, pp 12399\u201312407","DOI":"10.1609\/aaai.v37i10.26461"},{"key":"7115_CR10","doi-asserted-by":"crossref","unstructured":"Doerr B, Qu Z (2023) From understanding the population dynamics of the NSGA-II to the first proven lower bounds. In: Proceedings of the AAAI conference on artificial intelligence, vol 37, pp 12408\u201312416","DOI":"10.1609\/aaai.v37i10.26462"},{"key":"7115_CR11","doi-asserted-by":"crossref","unstructured":"Doerr B, Qu Z (2023) A first runtime analysis of the NSGA-II on a multimodal problem. IEEE Trans Evol Comput","DOI":"10.1145\/3583133.3595839"},{"key":"7115_CR12","doi-asserted-by":"crossref","unstructured":"Cerf S, Doerr B, Hebras B, Kahane Y, Wietheger S (2023) The first proven performance guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a combinatorial optimization problem. arXiv:2305.13459","DOI":"10.24963\/ijcai.2023\/613"},{"key":"7115_CR13","doi-asserted-by":"crossref","unstructured":"Huang Z, Zhou Y (2020) Runtime analysis of somatic contiguous hypermutation operators in MOEA\/D framework. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 2359\u20132366","DOI":"10.1609\/aaai.v34i03.5615"},{"key":"7115_CR14","doi-asserted-by":"crossref","unstructured":"Huang Z, Zhou Y, Luo C, Lin Q (2021) A runtime analysis of typical decomposition approaches in MOEA\/D framework for many-objective optimization problems. In: IJCAI, pp 1682\u20131688","DOI":"10.24963\/ijcai.2021\/232"},{"key":"7115_CR15","doi-asserted-by":"publisher","first-page":"36434","DOI":"10.52202\/075280-1581","volume":"36","author":"AV Do","year":"2023","unstructured":"Do AV, Neumann A, Neumann F, Sutton A (2023) Rigorous runtime analysis of MOEA\/D for solving multi-objective minimum weight base problems. Adv Neural Inf Process Syst 36:36434\u201336448","journal-title":"Adv Neural Inf Process Syst"},{"key":"7115_CR16","doi-asserted-by":"crossref","unstructured":"Wietheger S, Doerr B (2024) A mathematical runtime analysis of the non-dominated sorting genetic algorithm iii (NSGA-III). In: Proceedings of the genetic and evolutionary computation conference companion, pp 63\u201364","DOI":"10.1145\/3638530.3664062"},{"key":"7115_CR17","doi-asserted-by":"crossref","unstructured":"Opris A, Dang D-C, Neumann F, Sudholt D (2024) Runtime analyses of NSGA-III on many-objective problems. In: Proceedings of the genetic and evolutionary computation conference, pp 1596\u20131604","DOI":"10.1145\/3638529.3654218"},{"key":"7115_CR18","doi-asserted-by":"crossref","unstructured":"Doerr B, Zheng W (2021) Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Proceedings of the AAAI conference on artificial intelligence, vol 35, pp 12293\u201312301","DOI":"10.1609\/aaai.v35i14.17459"},{"key":"7115_CR19","doi-asserted-by":"crossref","unstructured":"Zheng W, Zhang Q, Chen H, Yao X (2021) When non-elitism meets time-linkage problems. In: Proceedings of the genetic and evolutionary computation conference, pp 741\u2013749","DOI":"10.1145\/3449639.3459347"},{"issue":"4","key":"7115_CR20","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TEVC.2021.3061442","volume":"25","author":"W Zheng","year":"2021","unstructured":"Zheng W, Chen H, Yao X (2021) Analysis of evolutionary algorithms on fitness function with time-linkage property. IEEE Trans Evol Comput 25(4):696\u2013709","journal-title":"IEEE Trans Evol Comput"},{"key":"7115_CR21","doi-asserted-by":"crossref","unstructured":"Yang T, Zhou Y (2024) Analysis of multi-objective evolutionary algorithms on fitness function with time-linkage property. IEEE Trans Evol Comput","DOI":"10.1109\/TEVC.2024.3371519"},{"key":"7115_CR22","doi-asserted-by":"crossref","unstructured":"Li M, Zheng W, Xie W, Sun A, Yao X (2024) When does the time-linkage property help optimization by evolutionary algorithms? In: International conference on parallel problem solving from nature. Springer, pp 280\u2013294","DOI":"10.1007\/978-3-031-70071-2_18"},{"key":"7115_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.swevo.2018.04.011","volume":"44","author":"H Ma","year":"2019","unstructured":"Ma H, Shen S, Yu M, Yang Z, Fei M, Zhou H (2019) Multi-population techniques in nature inspired optimization algorithms: a comprehensive survey. Swarm Evol Comput 44:365\u2013387","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"7115_CR24","doi-asserted-by":"publisher","first-page":"50","DOI":"10.3390\/jsan13050050","volume":"13","author":"Z AlMania","year":"2024","unstructured":"AlMania Z, Sheltami T, Ahmed G, Mahmoud A, Barnawi A (2024) Energy-efficient online path planning for internet of drones using reinforcement learning. J Sens Actuator Netw 13(5):50","journal-title":"J Sens Actuator Netw"},{"key":"7115_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101096","volume":"72","author":"F Li","year":"2022","unstructured":"Li F, Li Y, Cai X, Gao L (2022) A surrogate-assisted hybrid swarm optimization algorithm for high-dimensional computationally expensive problems. Swarm Evol Comput 72:101096","journal-title":"Swarm Evol Comput"},{"key":"7115_CR26","doi-asserted-by":"publisher","first-page":"106833","DOI":"10.1016\/j.cor.2024.106833","volume":"173","author":"Y-Y Yang","year":"2025","unstructured":"Yang Y-Y, Qian B, Li Z, Hu R, Wang L (2025) Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization: a case study on permutation flow-shop scheduling problem. Comput Oper Res 173:106833","journal-title":"Comput Oper Res"},{"key":"7115_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101423","volume":"83","author":"T Zhou","year":"2023","unstructured":"Zhou T, Han X, Wang L, Gan W, Chu Y, Gao M (2023) A multiobjective differential evolution algorithm with subpopulation region solution selection for global and local pareto optimal sets. Swarm Evol Comput 83:101423","journal-title":"Swarm Evol Comput"},{"key":"7115_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117444","volume":"203","author":"F Zhao","year":"2022","unstructured":"Zhao F, Zhou G, Wang L, Xu T, Zhu N et al (2022) A two-stage cooperative scatter search algorithm with multi-population hierarchical learning mechanism. Expert Syst Appl 203:117444","journal-title":"Expert Syst Appl"},{"key":"7115_CR29","doi-asserted-by":"publisher","unstructured":"Lin W-Y, Hong T-P, Liu S-M, Lin J-H (2012) Revisiting the design of adaptive migration schemes for multipopulation genetic algorithms, pp 338\u2013343. https:\/\/doi.org\/10.1109\/TAAI.2012.41","DOI":"10.1109\/TAAI.2012.41"},{"key":"7115_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-30698-8_16","volume-title":"Evolutionary computation in combinatorial optimization","author":"K Michalak","year":"2016","unstructured":"Michalak K (2016) Sim-eda: a multipopulation estimation of distribution algorithm based on problem similarity. In: Chicano F, Hu B, Garc\u00eda-S\u00e1nchez P (eds) Evolutionary computation in combinatorial optimization. Springer, Cham, pp 235\u2013250"},{"issue":"3","key":"7115_CR31","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/4235.873233","volume":"4","author":"E Cantu-Paz","year":"2000","unstructured":"Cantu-Paz E (2000) Markov chain models of parallel genetic algorithms. IEEE Trans Evol Comput 4(3):216\u2013226. https:\/\/doi.org\/10.1109\/4235.873233","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"7115_CR32","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.2991\/ijcis.d.191004.001","volume":"12","author":"N Wang","year":"2019","unstructured":"Wang N, Xu Q, Fei R, Yang J, Wang L (2019) Rigorous analysis of multi-factorial evolutionary algorithm as multi-population evolution model. Int J Comput Intell Syst 12(2):1121\u20131133","journal-title":"Int J Comput Intell Syst"},{"issue":"2","key":"7115_CR33","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns M, Thiele L, Zitzler E (2004) Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Trans Evol Comput 8(2):170\u2013182","journal-title":"IEEE Trans Evol Comput"},{"key":"7115_CR34","doi-asserted-by":"crossref","unstructured":"Bian C, Qian C (2022) Running time analysis of the non-dominated sorting genetic algorithm ii (nsga-ii) using binary or stochastic tournament selection. arXiv:2203.11550","DOI":"10.1007\/978-3-031-14721-0_30"},{"key":"7115_CR35","doi-asserted-by":"crossref","unstructured":"Bosman PA (2005) Learning, anticipation and time-deception in evolutionary online dynamic optimization. In: Proceedings of the 7th annual workshop on genetic and evolutionary computation, pp 39\u201347","DOI":"10.1145\/1102256.1102264"},{"key":"7115_CR36","unstructured":"Nguyen TT (2011) Continuous dynamic optimisation using evolutionary algorithms. PhD thesis, University of Birmingham"},{"key":"7115_CR37","doi-asserted-by":"crossref","unstructured":"Reintjes C (2022) Optimization of truss structures. In: Algorithm-driven truss topology optimization for additive manufacturing. Springer, pp 45\u201370","DOI":"10.1007\/978-3-658-36211-9_3"},{"issue":"3","key":"7115_CR38","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TEVC.2020.3044711","volume":"25","author":"Y Tian","year":"2020","unstructured":"Tian Y, Liu R, Zhang X, Ma H, Tan KC, Jin Y (2020) A multipopulation evolutionary algorithm for solving large-scale multimodal multiobjective optimization problems. IEEE Trans Evol Comput 25(3):405\u2013418","journal-title":"IEEE Trans Evol Comput"},{"key":"7115_CR39","doi-asserted-by":"publisher","unstructured":"Ozcelik G, Yeni FB, Yilmaz B, Yilmaz O (2025) A bi-objective robust optimization model to bolster a resilient medical supply chain in case of the ripple effect. Oper Res 25. https:\/\/doi.org\/10.1007\/s12351-025-00928-y","DOI":"10.1007\/s12351-025-00928-y"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07115-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-026-07115-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07115-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T10:43:40Z","timestamp":1779792220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-026-07115-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["7115"],"URL":"https:\/\/doi.org\/10.1007\/s10489-026-07115-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"7 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"258"}}