Stochastic population update can provably be helpful in multi-objective evolutionary algorithms
Evolutionary algorithms (EAs) have been widely and successfully applied to solve multi-objective optimization problems, due to their nature of population-based search. Population update, a key component in multi-objective EAs (MOEAs), is usually performed in a greedy, deterministic manner. That is,...
Uložené v:
| Vydané v: | Artificial intelligence Ročník 341; s. 104308 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.04.2025
|
| ISSN: | 0004-3702 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Evolutionary algorithms (EAs) have been widely and successfully applied to solve multi-objective optimization problems, due to their nature of population-based search. Population update, a key component in multi-objective EAs (MOEAs), is usually performed in a greedy, deterministic manner. That is, the next-generation population is formed by selecting the best solutions from the current population and newly-generated solutions (irrespective of the selection criteria used such as Pareto dominance, crowdedness and indicators). In this paper, we analytically present that stochastic population update can be beneficial for the search of MOEAs. Specifically, we prove that the expected running time of two well-established MOEAs, SMS-EMOA and NSGA-II, for solving two bi-objective problems, OneJumpZeroJump and bi-objective RealRoyalRoad, can be exponentially decreased if replacing its deterministic population update mechanism by a stochastic one. Empirical studies also verify the effectiveness of the proposed population update method. This work is an attempt to show the benefit of introducing randomness into the population update of MOEAs. Its positive results, which might hold more generally, should encourage the exploration of developing new MOEAs in the area. |
|---|---|
| AbstractList | Evolutionary algorithms (EAs) have been widely and successfully applied to solve multi-objective optimization problems, due to their nature of population-based search. Population update, a key component in multi-objective EAs (MOEAs), is usually performed in a greedy, deterministic manner. That is, the next-generation population is formed by selecting the best solutions from the current population and newly-generated solutions (irrespective of the selection criteria used such as Pareto dominance, crowdedness and indicators). In this paper, we analytically present that stochastic population update can be beneficial for the search of MOEAs. Specifically, we prove that the expected running time of two well-established MOEAs, SMS-EMOA and NSGA-II, for solving two bi-objective problems, OneJumpZeroJump and bi-objective RealRoyalRoad, can be exponentially decreased if replacing its deterministic population update mechanism by a stochastic one. Empirical studies also verify the effectiveness of the proposed population update method. This work is an attempt to show the benefit of introducing randomness into the population update of MOEAs. Its positive results, which might hold more generally, should encourage the exploration of developing new MOEAs in the area. |
| ArticleNumber | 104308 |
| Author | Qian, Chao Bian, Chao Zhou, Yawen Li, Miqing |
| Author_xml | – sequence: 1 givenname: Chao orcidid: 0000-0003-2312-6733 surname: Bian fullname: Bian, Chao email: bianc@lamda.nju.edu.cn organization: National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China – sequence: 2 givenname: Yawen surname: Zhou fullname: Zhou, Yawen email: zhouyw@lamda.nju.edu.cn organization: National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China – sequence: 3 givenname: Miqing surname: Li fullname: Li, Miqing email: m.li.8@bham.ac.uk organization: School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK – sequence: 4 givenname: Chao orcidid: 0000-0001-6011-2512 surname: Qian fullname: Qian, Chao email: qianc@lamda.nju.edu.cn organization: National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China |
| BookMark | eNp9kMtqwzAQRbVIoUnaP-hCP-BUDz83hRL6gkAXbddCkkeNjGIZSTbk7-vgrrMaZuBc7pwNWvW-B4QeKNlRQsvHbidDsn3aMcKK-ZRzUq_QmhCSZ7wi7BZtYuzmlTcNXSPxlbw-ypisxoMfRieT9T0eh1YmwFr2eAh-ksqdsQJ8BDeY0WHb49Poks286kAnOwGGybvxwspwxtL9-mDT8RTv0I2RLsL9_9yin9eX7_17dvh8-9g_HzLNiiJltSqhMryoad1Co6qKMsVbw-rSlKAaqcGYnFMJvDKU8xwkZcZoYEqyJuct36J8ydXBxxjAiCHY09xFUCIuYkQnFjHiIkYsYmbsacFg7jZZCCJqC72G1ob5MdF6ez3gD2fBdZo |
| Cites_doi | 10.1016/j.ejor.2006.08.005 10.1023/B:NACO.0000023415.22052.55 10.1016/j.ejor.2006.08.008 10.1016/j.tcs.2020.09.032 10.1162/EVCO_a_00013 10.1162/evco_a_00283 10.1109/TEVC.2004.823470 10.1109/TEVC.2023.3320278 10.1016/j.artint.2023.104016 10.1109/TAI.2024.3443790 10.1016/j.artint.2019.06.005 10.1016/j.swevo.2011.03.001 10.1162/evco_a_00328 10.1016/j.tcs.2018.06.009 10.1007/s11432-023-3864-6 10.1016/j.artint.2024.104098 10.1016/j.tcs.2010.09.023 10.1109/TEVC.2007.892759 10.1109/TEVC.2013.2281535 10.1016/j.artint.2013.09.002 10.1016/j.artint.2021.103597 10.1007/s11704-023-2740-6 10.1109/4235.996017 10.1109/TEVC.2023.3250552 10.1007/s00453-017-0369-2 10.1016/S0004-3702(01)00058-3 10.1016/j.tcs.2014.06.023 10.1007/s00453-022-01044-5 10.1007/s11432-023-3895-3 10.1162/EVCO_a_00159 10.1016/j.tcs.2009.06.020 10.1007/s00453-015-0103-x 10.1109/4235.797969 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier B.V. |
| Copyright_xml | – notice: 2025 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.artint.2025.104308 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_artint_2025_104308 S000437022500027X |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6J9 6TJ 7-5 71M 77K 8P~ 9JN AAEDT AAEDW AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO ABBOA ABDPE ABFNM ABFRF ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACVFH ACWUS ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AECPX AEFWE AEIPS AEKER AENEX AETEA AEUPX AEXQZ AFJKZ AFPUW AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNPGV CS3 E3Z EBS EFJIC EFKBS EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM LG9 LY7 M41 MO0 MVM N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL WH7 WUQ XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AAYXX ACLOT CITATION EFLBG ~HD |
| ID | FETCH-LOGICAL-c255t-8b6e7f35818de9b7712b3df286f6eb9aceff431ae37f1334ea12ffce2ba2943d3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001428677500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0004-3702 |
| IngestDate | Sat Nov 29 07:48:53 EST 2025 Tue Jul 29 20:22:41 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c255t-8b6e7f35818de9b7712b3df286f6eb9aceff431ae37f1334ea12ffce2ba2943d3 |
| ORCID | 0000-0001-6011-2512 0000-0003-2312-6733 |
| ParticipantIDs | crossref_primary_10_1016_j_artint_2025_104308 elsevier_sciencedirect_doi_10_1016_j_artint_2025_104308 |
| PublicationCentury | 2000 |
| PublicationDate | April 2025 2025-04-00 |
| PublicationDateYYYYMMDD | 2025-04-01 |
| PublicationDate_xml | – month: 04 year: 2025 text: April 2025 |
| PublicationDecade | 2020 |
| PublicationTitle | Artificial intelligence |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Brockhoff, Friedrich, Neumann (br0080) 2008 Yang, Zhang, Liu, Li (br0680) 2024; 67 Obayashi, Takahashi, Fejtek (br0530) 1998 Dang, Opris, Sudholt (br0150) 2024; 330 Doerr, Qu (br0250) 2023; 27 Deb (br0160) 2001 Zhou, Yu, Qian (br0760) 2019 Zheng, Doerr (br0700) 2023; 325 Laumanns, Thiele, Zitzler (br0390) 2004; 8 Lu, Whalen, Boddeti, Dhebar, Deb, Goodman, Banzhaf (br0480) 2019 Dinot, Doerr, Hennebelle, Will (br0190) 2023 Doerr, Gao, Neumann (br0220) 2016 Huang, Zhou, Luo, Lin (br0370) 2021 Beume, Naujoks, Emmerich (br0030) 2007; 181 Doerr (br0210) 2021; 29 Neumann, Theile (br0510) 2010 Bäck (br0020) 1996 Dang, Eremeev, Lehre (br0120) 2021 Liu, Xu, Qian (br0460) 2024 Neumann (br0500) 2007; 181 Bian, Ren, Li, Qian (br0060) 2024 Doerr, Qu (br0270) 2023 Cerf, Doerr, Hebras, Kahane, Wietheger (br0090) 2023 Deb, Jain (br0170) 2014; 18 Lehre, Qin (br0410) 2024; 86 Eiben, Smith (br0280) 2015 Lehre (br0400) 2011 (br0240) 2020 Bian, Qian, Tang (br0050) 2018 Doerr (br0200) 2021; 851 Zheng, Doerr (br0720) 2024; 28 Qian, Yu, Zhou (br0600) 2015 Roostapour, Neumann, Neumann, Friedrich (br0640) 2022; 302 Qian, Yu, Zhou (br0590) 2013; 204 Wietheger, Doerr (br0660) 2024 Zheng, Doerr (br0710) 2023; 31 Laumanns, Thiele, Zitzler (br0380) 2004; 3 Markowitz (br0490) 1952; 7 He, Yao (br0350) 2001; 127 Zhou, Qu, Li, Zhao, Suganthan, Zhang (br0750) 2011; 1 Zheng, Doerr (br0740) 2025 Liu, Gu, Qian, Mu, Tang (br0450) 2025; 6 Doerr, Kodric, Voigt (br0230) 2013 Friedrich, Neumann (br0310) 2015; 23 Nguyen, Sutton, Neumann (br0520) 2015; 561 Deb, Pratap, Agarwal, Meyarivan (br0180) 2002; 6 Goldberg (br0340) 1989 Ren, Bian, Li, Qian (br0610) 2024 Zitzler, Thiele (br0790) 1999; 3 Li, Han, Chu (br0420) 2023 Dang, Opris, Salehi, Sudholt (br0140) 2023 Qian, Shi, Yu, Tang, Zhou (br0560) 2017 Wu, Qian, Liu, Zhou, Zhou (br0670) 2023; 17 Oliveto, Paixão, Pérez Heredia, Sudholt, Trubenová (br0540) 2018; 80 Bian, Qian (br0040) 2022 Ren, Qiu, Bian, Li, Qian (br0620) 2024 Robbins (br0630) 1955; 62 Zitzler, Laumanns, Thiele (br0780) 2001; 103 Liang, Zhang, Chen, Qu, Yu, Yue, Suganthan (br0430) 2024; 67 Aguirre, Tanaka (br0010) 2004 Covantes Osuna, Gao, Neumann, Sudholt (br0110) 2020; 832 Liang, Li, Lehre (br0440) 2023 Qian, Tang, Zhou (br0570) 2016 Coello Coello, Lamont, Van Veldhuizen (br0100) 2007 Lu, Bian, Qian (br0470) 2024 Doerr, Qu (br0260) 2023 Friedrich, Hebbinghaus, Neumann (br0290) 2010; 411 Giel, Lehre (br0330) 2010; 18 Bian, Zhou, Li, Qian (br0070) 2023 Dang, Lehre (br0130) 2016; 75 Zhang, Li (br0690) 2007; 11 Wietheger, Doerr (br0650) 2023 Giel (br0320) 2003 Qian, Yu, Tang, Yao, Zhou (br0580) 2019; 275 Friedrich, Horoba, Neumann (br0300) 2011; 412 Horoba (br0360) 2009 Pahl, Beitz (br0550) 1996 Zheng, Doerr (br0730) 2024 Zitzler, Künzli (br0770) 2004 Bäck (10.1016/j.artint.2025.104308_br0020) 1996 Horoba (10.1016/j.artint.2025.104308_br0360) 2009 Zheng (10.1016/j.artint.2025.104308_br0700) 2023; 325 Friedrich (10.1016/j.artint.2025.104308_br0310) 2015; 23 Doerr (10.1016/j.artint.2025.104308_br0210) 2021; 29 Dang (10.1016/j.artint.2025.104308_br0150) 2024; 330 Liang (10.1016/j.artint.2025.104308_br0430) 2024; 67 Lehre (10.1016/j.artint.2025.104308_br0410) 2024; 86 Giel (10.1016/j.artint.2025.104308_br0330) 2010; 18 Covantes Osuna (10.1016/j.artint.2025.104308_br0110) 2020; 832 Friedrich (10.1016/j.artint.2025.104308_br0300) 2011; 412 Deb (10.1016/j.artint.2025.104308_br0160) 2001 Ren (10.1016/j.artint.2025.104308_br0610) 2024 Ren (10.1016/j.artint.2025.104308_br0620) 2024 Brockhoff (10.1016/j.artint.2025.104308_br0080) 2008 He (10.1016/j.artint.2025.104308_br0350) 2001; 127 Zitzler (10.1016/j.artint.2025.104308_br0770) 2004 Lu (10.1016/j.artint.2025.104308_br0480) 2019 Doerr (10.1016/j.artint.2025.104308_br0250) 2023; 27 Wu (10.1016/j.artint.2025.104308_br0670) 2023; 17 Doerr (10.1016/j.artint.2025.104308_br0200) 2021; 851 Markowitz (10.1016/j.artint.2025.104308_br0490) 1952; 7 Wietheger (10.1016/j.artint.2025.104308_br0660) 2024 Eiben (10.1016/j.artint.2025.104308_br0280) 2015 Zheng (10.1016/j.artint.2025.104308_br0730) Zitzler (10.1016/j.artint.2025.104308_br0780) 2001; 103 Neumann (10.1016/j.artint.2025.104308_br0500) 2007; 181 Neumann (10.1016/j.artint.2025.104308_br0510) 2010 Pahl (10.1016/j.artint.2025.104308_br0550) 1996 Bian (10.1016/j.artint.2025.104308_br0070) 2023 Qian (10.1016/j.artint.2025.104308_br0590) 2013; 204 Zheng (10.1016/j.artint.2025.104308_br0740) 2025 Lu (10.1016/j.artint.2025.104308_br0470) 2024 Zheng (10.1016/j.artint.2025.104308_br0720) 2024; 28 Aguirre (10.1016/j.artint.2025.104308_br0010) 2004 Giel (10.1016/j.artint.2025.104308_br0320) 2003 Dinot (10.1016/j.artint.2025.104308_br0190) 2023 Qian (10.1016/j.artint.2025.104308_br0560) 2017 Dang (10.1016/j.artint.2025.104308_br0140) 2023 Zheng (10.1016/j.artint.2025.104308_br0710) 2023; 31 Dang (10.1016/j.artint.2025.104308_br0120) 2021 Laumanns (10.1016/j.artint.2025.104308_br0390) 2004; 8 Zhou (10.1016/j.artint.2025.104308_br0760) 2019 Dang (10.1016/j.artint.2025.104308_br0130) 2016; 75 Nguyen (10.1016/j.artint.2025.104308_br0520) 2015; 561 Doerr (10.1016/j.artint.2025.104308_br0230) 2013 Friedrich (10.1016/j.artint.2025.104308_br0290) 2010; 411 Deb (10.1016/j.artint.2025.104308_br0180) 2002; 6 Oliveto (10.1016/j.artint.2025.104308_br0540) 2018; 80 Bian (10.1016/j.artint.2025.104308_br0050) 2018 Coello Coello (10.1016/j.artint.2025.104308_br0100) 2007 Zhou (10.1016/j.artint.2025.104308_br0750) 2011; 1 Li (10.1016/j.artint.2025.104308_br0420) 2023 Zitzler (10.1016/j.artint.2025.104308_br0790) 1999; 3 Cerf (10.1016/j.artint.2025.104308_br0090) 2023 Laumanns (10.1016/j.artint.2025.104308_br0380) 2004; 3 Obayashi (10.1016/j.artint.2025.104308_br0530) 1998 Robbins (10.1016/j.artint.2025.104308_br0630) 1955; 62 (10.1016/j.artint.2025.104308_br0240) 2020 Beume (10.1016/j.artint.2025.104308_br0030) 2007; 181 Doerr (10.1016/j.artint.2025.104308_br0270) 2023 Doerr (10.1016/j.artint.2025.104308_br0260) 2023 Yang (10.1016/j.artint.2025.104308_br0680) 2024; 67 Wietheger (10.1016/j.artint.2025.104308_br0650) 2023 Liu (10.1016/j.artint.2025.104308_br0450) 2025; 6 Goldberg (10.1016/j.artint.2025.104308_br0340) 1989 Roostapour (10.1016/j.artint.2025.104308_br0640) 2022; 302 Lehre (10.1016/j.artint.2025.104308_br0400) 2011 Liang (10.1016/j.artint.2025.104308_br0440) 2023 Zhang (10.1016/j.artint.2025.104308_br0690) 2007; 11 Deb (10.1016/j.artint.2025.104308_br0170) 2014; 18 Qian (10.1016/j.artint.2025.104308_br0600) 2015 Bian (10.1016/j.artint.2025.104308_br0060) 2024 Bian (10.1016/j.artint.2025.104308_br0040) 2022 Huang (10.1016/j.artint.2025.104308_br0370) 2021 Liu (10.1016/j.artint.2025.104308_br0460) 2024 Qian (10.1016/j.artint.2025.104308_br0570) 2016 Doerr (10.1016/j.artint.2025.104308_br0220) 2016 Qian (10.1016/j.artint.2025.104308_br0580) 2019; 275 |
| References_xml | – start-page: 1682 year: 2021 end-page: 1688 ident: br0370 article-title: A runtime analysis of typical decomposition approaches in MOEA/D framework for many-objective optimization problems publication-title: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI'21) – volume: 27 start-page: 1288 year: 2023 end-page: 1297 ident: br0250 article-title: A first runtime analysis of the NSGA-II on a multimodal problem publication-title: IEEE Trans. Evol. Comput. – start-page: 428 year: 2022 end-page: 441 ident: br0040 article-title: Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection publication-title: Proceedings of the 17th International Conference on Parallel Problem Solving from Nature (PPSN'22) – volume: 832 start-page: 123 year: 2020 end-page: 142 ident: br0110 article-title: Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation publication-title: Theor. Comput. Sci. – start-page: 5513 year: 2023 end-page: 5521 ident: br0070 article-title: Stochastic population update can provably be helpful in multi-objective evolutionary algorithms publication-title: Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI'23) – start-page: 5549 year: 2023 end-page: 5557 ident: br0190 article-title: Runtime analyses of multi-objective evolutionary algorithms in the presence of noise publication-title: Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI'23) – year: 2015 ident: br0280 article-title: Introduction to Evolutionary Computing – volume: 80 start-page: 1604 year: 2018 end-page: 1633 ident: br0540 article-title: How to escape local optima in black box optimisation: when non-elitism outperforms elitism publication-title: Algorithmica – start-page: 651 year: 2008 end-page: 660 ident: br0080 article-title: Analyzing hypervolume indicator based algorithms publication-title: Proceedings of the 10th International Conference on Parallel Problem Solving from Nature (PPSN'08) – volume: 23 start-page: 543 year: 2015 end-page: 558 ident: br0310 article-title: Maximizing submodular functions under matroid constraints by evolutionary algorithms publication-title: Evol. Comput. – volume: 181 start-page: 1653 year: 2007 end-page: 1669 ident: br0030 article-title: SMS-EMOA: multiobjective selection based on dominated hypervolume publication-title: Eur. J. Oper. Res. – start-page: 432 year: 2013 end-page: 439 ident: br0230 article-title: Lower bounds for the runtime of a global multi-objective evolutionary algorithm publication-title: Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC'13) – volume: 75 start-page: 428 year: 2016 end-page: 461 ident: br0130 article-title: Runtime analysis of non-elitist populations: from classical optimisation to partial information publication-title: Algorithmica – volume: 7 start-page: 77 year: 1952 end-page: 91 ident: br0490 article-title: Portfolio selection publication-title: J. Finance – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: br0180 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Trans. Evol. Comput. – start-page: 642 year: 2023 end-page: 651 ident: br0140 article-title: Analysing the robustness of NSGA-II under noise publication-title: Proceedings of the 25th ACM Conference on Genetic and Evolutionary Computation (GECCO'23) – start-page: 1405 year: 2018 end-page: 1411 ident: br0050 article-title: A general approach to running time analysis of multi-objective evolutionary algorithms publication-title: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI'18) – year: 1998 ident: br0530 article-title: Transonic wing design by inverse optimization using MOGA publication-title: Proceedings of the 6th Annual Conference of the Computational Fluid Dynamics Society of Canada (CFD'98) – volume: 127 start-page: 57 year: 2001 end-page: 85 ident: br0350 article-title: Drift analysis and average time complexity of evolutionary algorithms publication-title: Artif. Intell. – volume: 28 start-page: 1442 year: 2024 end-page: 1454 ident: br0720 article-title: Runtime analysis for the NSGA-II: proving, quantifying, and explaining the inefficiency for many objectives publication-title: IEEE Trans. Evol. Comput. – start-page: 153 year: 2024 end-page: 168 ident: br0660 article-title: Near-tight runtime guarantees for many-objective evolutionary algorithms publication-title: Proceedings of the 18th International Conference on Parallel Problem Solving from Nature (PPSN'24) – start-page: 557 year: 2016 end-page: 564 ident: br0220 article-title: Runtime analysis of evolutionary diversity maximization for OneMinMax publication-title: Proceedings of the 18th ACM Conference on Genetic and Evolutionary Computation (GECCO'16) – start-page: 295 year: 2024 end-page: 312 ident: br0610 article-title: A first running time analysis of the strength Pareto evolutionary algorithm 2 (SPEA2) publication-title: Proceedings of the 18th International Conference on Parallel Problem Solving from Nature (PPSN'24) – start-page: 3563 year: 2017 end-page: 3573 ident: br0560 article-title: Subset selection under noise publication-title: Advances in Neural Information Processing Systems 30 (NeurIPS'17), Long Beach, CA – volume: 31 start-page: 337 year: 2023 end-page: 373 ident: br0710 article-title: Theoretical analyses of multiobjective evolutionary algorithms on multimodal objectives publication-title: Evol. Comput. – volume: 412 start-page: 1546 year: 2011 end-page: 1556 ident: br0300 article-title: Illustration of fairness in evolutionary multi-objective optimization publication-title: Theor. Comput. Sci. – year: 2024 ident: br0730 article-title: Runtime analysis of the SMS-EMOA for many-objective optimization – start-page: 6905 year: 2024 end-page: 6913 ident: br0060 article-title: An archive can bring provable speed-ups in multi-objective evolutionary algorithms publication-title: Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI'24) – volume: 3 start-page: 257 year: 1999 end-page: 271 ident: br0790 article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach publication-title: IEEE Trans. Evol. Comput. – volume: 181 start-page: 1620 year: 2007 end-page: 1629 ident: br0500 article-title: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem publication-title: Eur. J. Oper. Res. – start-page: 1765 year: 2015 end-page: 1773 ident: br0600 article-title: Subset selection by Pareto optimization publication-title: Advances in Neural Information Processing Systems 28 (NeurIPS'15), Montreal, Canada – volume: 851 start-page: 24 year: 2021 end-page: 38 ident: br0200 article-title: Exponential upper bounds for the runtime of randomized search heuristics publication-title: Theor. Comput. Sci. – year: 2020 ident: br0240 publication-title: Theory of Evolutionary Computation: Recent Developments in Discrete Optimization – start-page: 667 year: 2010 end-page: 676 ident: br0510 article-title: How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem publication-title: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN'10) – volume: 103 year: 2001 ident: br0780 article-title: SPEA2: improving the strength Pareto evolutionary algorithm publication-title: TIK-Rep. – volume: 29 start-page: 305 year: 2021 end-page: 329 ident: br0210 article-title: Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift publication-title: Evol. Comput. – start-page: 303 year: 2023 end-page: 311 ident: br0420 article-title: MOEAs are stuck in a different area at a time publication-title: Proceedings of the 25th ACM Conference on Genetic and Evolutionary Computation (GECCO'23) – start-page: 5522 year: 2023 end-page: 5530 ident: br0090 article-title: The first proven performance guarantees for the non-dominated sorting genetic algorithm II (NSGA-II) on a combinatorial optimization problem publication-title: Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI'23) – volume: 3 start-page: 37 year: 2004 end-page: 51 ident: br0380 article-title: Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem publication-title: Nat. Comput. – start-page: 383 year: 2023 end-page: 386 ident: br0440 article-title: Non-elitist evolutionary multi-objective optimisation: proof-of-principle results publication-title: Proceedings of the 25th ACM Conference on Genetic and Evolutionary Computation Companion (GECCO'23 Companion) – volume: 17 year: 2023 ident: br0670 article-title: Bi-objective evolutionary Bayesian network structure learning via skeleton constraint publication-title: Front. Comput. Sci. – start-page: 113 year: 2009 end-page: 120 ident: br0360 article-title: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem publication-title: Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA'09) – start-page: 6967 year: 2024 end-page: 6975 ident: br0460 article-title: Peptide vaccine design by evolutionary multi-objective optimization publication-title: Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI'24) – volume: 86 start-page: 396 year: 2024 end-page: 441 ident: br0410 article-title: More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments publication-title: Algorithmica – start-page: 12399 year: 2023 end-page: 12407 ident: br0270 article-title: Runtime analysis for the NSGA-II: provable speed-ups from crossover publication-title: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI'23) – start-page: 5657 year: 2023 end-page: 5665 ident: br0650 article-title: A mathematical runtime analysis of the non-dominated sorting genetic algorithm III (NSGA-III) publication-title: Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI'23) – year: 2001 ident: br0160 article-title: Multi-Objective Optimization Using Evolutionary Algorithms – volume: 8 start-page: 170 year: 2004 end-page: 182 ident: br0390 article-title: Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions publication-title: IEEE Trans. Evol. Comput. – start-page: 2075 year: 2011 end-page: 2082 ident: br0400 article-title: Fitness-levels for non-elitist populations publication-title: Proceedings of the 13th ACM Conference on Genetic and Evolutionary Computation (GECCO'11) – year: 1996 ident: br0020 article-title: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms – volume: 330 year: 2024 ident: br0150 article-title: Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation publication-title: Artif. Intell. – start-page: 12408 year: 2023 end-page: 12416 ident: br0260 article-title: From understanding the population dynamics of the NSGA-II to the first proven lower bounds publication-title: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI'23) – year: 1996 ident: br0550 article-title: Engineering Design: A Systematic Approach – volume: 62 start-page: 26 year: 1955 end-page: 29 ident: br0630 article-title: A remark on Stirling's formula publication-title: Am. Math. Mon. – volume: 6 start-page: 51 year: 2025 end-page: 65 ident: br0450 article-title: Migrant resettlement by evolutionary multi-objective optimization publication-title: IEEE Trans. Artif. Intell. – start-page: 20777 year: 2024 end-page: 20785 ident: br0470 article-title: Towards running time analysis of interactive multi-objective evolutionary algorithms publication-title: Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI'24) – volume: 18 start-page: 335 year: 2010 end-page: 356 ident: br0330 article-title: On the effect of populations in evolutionary multi-objective optimisation publication-title: Evol. Comput. – start-page: 12275 year: 2021 end-page: 12283 ident: br0120 article-title: Escaping local optima with non-elitist evolutionary algorithms publication-title: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI'21) – volume: 275 start-page: 279 year: 2019 end-page: 294 ident: br0580 article-title: Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms publication-title: Artif. Intell. – volume: 204 start-page: 99 year: 2013 end-page: 119 ident: br0590 article-title: An analysis on recombination in multi-objective evolutionary optimization publication-title: Artif. Intell. – volume: 411 start-page: 854 year: 2010 end-page: 864 ident: br0290 article-title: Plateaus can be harder in multi-objective optimization publication-title: Theor. Comput. Sci. – year: 2025 ident: br0740 article-title: Approximation guarantees for the non-dominated sorting genetic algorithm II (NSGA-II) publication-title: IEEE Trans. Evol. Comput. – volume: 67 year: 2024 ident: br0430 article-title: An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification publication-title: Sci. China Inf. Sci. – volume: 1 start-page: 32 year: 2011 end-page: 49 ident: br0750 article-title: Multiobjective evolutionary algorithms: a survey of the state of the art publication-title: Swarm Evol. Comput. – year: 1989 ident: br0340 article-title: Genetic Algorithms in Search, Optimization, and Machine Learning – start-page: 419 year: 2019 end-page: 427 ident: br0480 article-title: NSGA-Net: neural architecture search using multi-objective genetic algorithm publication-title: Proceedings of the 21th ACM Conference on Genetic and Evolutionary Computation (GECCO'19) – volume: 11 start-page: 712 year: 2007 end-page: 731 ident: br0690 article-title: MOEA/D: a multiobjective evolutionary algorithm based on decomposition publication-title: IEEE Trans. Evol. Comput. – start-page: 832 year: 2004 end-page: 842 ident: br0770 article-title: Indicator-based selection in multiobjective search publication-title: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN'04) – start-page: 835 year: 2016 end-page: 846 ident: br0570 article-title: Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization publication-title: Proceedings of the 14th International Conference on Parallel Problem Solving from Nature (PPSN'16) – start-page: 7012 year: 2024 end-page: 7020 ident: br0620 article-title: Maintaining diversity provably helps in evolutionary multimodal optimization publication-title: Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI'24) – year: 2019 ident: br0760 article-title: Evolutionary Learning: Advances in Theories and Algorithms – year: 2007 ident: br0100 article-title: Evolutionary Algorithms for Solving Multi-Objective Problems – volume: 18 start-page: 577 year: 2014 end-page: 601 ident: br0170 article-title: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints publication-title: IEEE Trans. Evol. Comput. – start-page: 1918 year: 2003 end-page: 1925 ident: br0320 article-title: Expected runtimes of a simple multi-objective evolutionary algorithm publication-title: Proceedings of the 2003 IEEE Congress on Evolutionary Computation (CEC'03) – volume: 67 year: 2024 ident: br0680 article-title: Reducing idleness in financial cloud services via multi-objective evolutionary reinforcement learning based load balancer publication-title: Sci. China Inf. Sci. – volume: 325 year: 2023 ident: br0700 article-title: Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) publication-title: Artif. Intell. – volume: 302 year: 2022 ident: br0640 article-title: Pareto optimization for subset selection with dynamic cost constraints publication-title: Artif. Intell. – volume: 561 start-page: 24 year: 2015 end-page: 36 ident: br0520 article-title: Population size matters: rigorous runtime results for maximizing the hypervolume indicator publication-title: Theor. Comput. Sci. – start-page: 196 year: 2004 end-page: 203 ident: br0010 article-title: Insights on properties of multiobjective MNK-landscapes publication-title: Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC'04) – volume: 181 start-page: 1620 issue: 3 year: 2007 ident: 10.1016/j.artint.2025.104308_br0500 article-title: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.08.005 – start-page: 642 year: 2023 ident: 10.1016/j.artint.2025.104308_br0140 article-title: Analysing the robustness of NSGA-II under noise – start-page: 196 year: 2004 ident: 10.1016/j.artint.2025.104308_br0010 article-title: Insights on properties of multiobjective MNK-landscapes – volume: 3 start-page: 37 year: 2004 ident: 10.1016/j.artint.2025.104308_br0380 article-title: Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem publication-title: Nat. Comput. doi: 10.1023/B:NACO.0000023415.22052.55 – year: 1996 ident: 10.1016/j.artint.2025.104308_br0020 – start-page: 153 year: 2024 ident: 10.1016/j.artint.2025.104308_br0660 article-title: Near-tight runtime guarantees for many-objective evolutionary algorithms – volume: 181 start-page: 1653 year: 2007 ident: 10.1016/j.artint.2025.104308_br0030 article-title: SMS-EMOA: multiobjective selection based on dominated hypervolume publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.08.008 – volume: 851 start-page: 24 year: 2021 ident: 10.1016/j.artint.2025.104308_br0200 article-title: Exponential upper bounds for the runtime of randomized search heuristics publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2020.09.032 – start-page: 12275 year: 2021 ident: 10.1016/j.artint.2025.104308_br0120 article-title: Escaping local optima with non-elitist evolutionary algorithms – year: 1996 ident: 10.1016/j.artint.2025.104308_br0550 – volume: 18 start-page: 335 issue: 3 year: 2010 ident: 10.1016/j.artint.2025.104308_br0330 article-title: On the effect of populations in evolutionary multi-objective optimisation publication-title: Evol. Comput. doi: 10.1162/EVCO_a_00013 – volume: 29 start-page: 305 issue: 2 year: 2021 ident: 10.1016/j.artint.2025.104308_br0210 article-title: Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift publication-title: Evol. Comput. doi: 10.1162/evco_a_00283 – start-page: 12399 year: 2023 ident: 10.1016/j.artint.2025.104308_br0270 article-title: Runtime analysis for the NSGA-II: provable speed-ups from crossover – start-page: 295 year: 2024 ident: 10.1016/j.artint.2025.104308_br0610 article-title: A first running time analysis of the strength Pareto evolutionary algorithm 2 (SPEA2) – start-page: 5549 year: 2023 ident: 10.1016/j.artint.2025.104308_br0190 article-title: Runtime analyses of multi-objective evolutionary algorithms in the presence of noise – volume: 8 start-page: 170 issue: 2 year: 2004 ident: 10.1016/j.artint.2025.104308_br0390 article-title: Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2004.823470 – volume: 28 start-page: 1442 issue: 5 year: 2024 ident: 10.1016/j.artint.2025.104308_br0720 article-title: Runtime analysis for the NSGA-II: proving, quantifying, and explaining the inefficiency for many objectives publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2023.3320278 – start-page: 832 year: 2004 ident: 10.1016/j.artint.2025.104308_br0770 article-title: Indicator-based selection in multiobjective search – start-page: 6967 year: 2024 ident: 10.1016/j.artint.2025.104308_br0460 article-title: Peptide vaccine design by evolutionary multi-objective optimization – volume: 325 year: 2023 ident: 10.1016/j.artint.2025.104308_br0700 article-title: Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) publication-title: Artif. Intell. doi: 10.1016/j.artint.2023.104016 – start-page: 12408 year: 2023 ident: 10.1016/j.artint.2025.104308_br0260 article-title: From understanding the population dynamics of the NSGA-II to the first proven lower bounds – volume: 6 start-page: 51 issue: 1 year: 2025 ident: 10.1016/j.artint.2025.104308_br0450 article-title: Migrant resettlement by evolutionary multi-objective optimization publication-title: IEEE Trans. Artif. Intell. doi: 10.1109/TAI.2024.3443790 – start-page: 1405 year: 2018 ident: 10.1016/j.artint.2025.104308_br0050 article-title: A general approach to running time analysis of multi-objective evolutionary algorithms – volume: 275 start-page: 279 year: 2019 ident: 10.1016/j.artint.2025.104308_br0580 article-title: Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms publication-title: Artif. Intell. doi: 10.1016/j.artint.2019.06.005 – volume: 1 start-page: 32 issue: 1 year: 2011 ident: 10.1016/j.artint.2025.104308_br0750 article-title: Multiobjective evolutionary algorithms: a survey of the state of the art publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.03.001 – start-page: 113 year: 2009 ident: 10.1016/j.artint.2025.104308_br0360 article-title: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem – start-page: 3563 year: 2017 ident: 10.1016/j.artint.2025.104308_br0560 article-title: Subset selection under noise – start-page: 7012 year: 2024 ident: 10.1016/j.artint.2025.104308_br0620 article-title: Maintaining diversity provably helps in evolutionary multimodal optimization – volume: 31 start-page: 337 issue: 4 year: 2023 ident: 10.1016/j.artint.2025.104308_br0710 article-title: Theoretical analyses of multiobjective evolutionary algorithms on multimodal objectives publication-title: Evol. Comput. doi: 10.1162/evco_a_00328 – start-page: 1765 year: 2015 ident: 10.1016/j.artint.2025.104308_br0600 article-title: Subset selection by Pareto optimization – volume: 832 start-page: 123 year: 2020 ident: 10.1016/j.artint.2025.104308_br0110 article-title: Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2018.06.009 – start-page: 6905 year: 2024 ident: 10.1016/j.artint.2025.104308_br0060 article-title: An archive can bring provable speed-ups in multi-objective evolutionary algorithms – volume: 67 issue: 2 year: 2024 ident: 10.1016/j.artint.2025.104308_br0430 article-title: An evolutionary multiobjective method based on dominance and decomposition for feature selection in classification publication-title: Sci. China Inf. Sci. doi: 10.1007/s11432-023-3864-6 – volume: 330 year: 2024 ident: 10.1016/j.artint.2025.104308_br0150 article-title: Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation publication-title: Artif. Intell. doi: 10.1016/j.artint.2024.104098 – year: 2019 ident: 10.1016/j.artint.2025.104308_br0760 – volume: 103 year: 2001 ident: 10.1016/j.artint.2025.104308_br0780 article-title: SPEA2: improving the strength Pareto evolutionary algorithm publication-title: TIK-Rep. – start-page: 383 year: 2023 ident: 10.1016/j.artint.2025.104308_br0440 article-title: Non-elitist evolutionary multi-objective optimisation: proof-of-principle results – year: 2001 ident: 10.1016/j.artint.2025.104308_br0160 – volume: 412 start-page: 1546 issue: 17 year: 2011 ident: 10.1016/j.artint.2025.104308_br0300 article-title: Illustration of fairness in evolutionary multi-objective optimization publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.09.023 – volume: 11 start-page: 712 issue: 6 year: 2007 ident: 10.1016/j.artint.2025.104308_br0690 article-title: MOEA/D: a multiobjective evolutionary algorithm based on decomposition publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2007.892759 – start-page: 419 year: 2019 ident: 10.1016/j.artint.2025.104308_br0480 article-title: NSGA-Net: neural architecture search using multi-objective genetic algorithm – volume: 18 start-page: 577 issue: 4 year: 2014 ident: 10.1016/j.artint.2025.104308_br0170 article-title: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2013.2281535 – volume: 204 start-page: 99 year: 2013 ident: 10.1016/j.artint.2025.104308_br0590 article-title: An analysis on recombination in multi-objective evolutionary optimization publication-title: Artif. Intell. doi: 10.1016/j.artint.2013.09.002 – volume: 302 year: 2022 ident: 10.1016/j.artint.2025.104308_br0640 article-title: Pareto optimization for subset selection with dynamic cost constraints publication-title: Artif. Intell. doi: 10.1016/j.artint.2021.103597 – start-page: 303 year: 2023 ident: 10.1016/j.artint.2025.104308_br0420 article-title: MOEAs are stuck in a different area at a time – year: 1998 ident: 10.1016/j.artint.2025.104308_br0530 article-title: Transonic wing design by inverse optimization using MOGA – start-page: 5513 year: 2023 ident: 10.1016/j.artint.2025.104308_br0070 article-title: Stochastic population update can provably be helpful in multi-objective evolutionary algorithms – start-page: 835 year: 2016 ident: 10.1016/j.artint.2025.104308_br0570 article-title: Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization – year: 2007 ident: 10.1016/j.artint.2025.104308_br0100 – volume: 7 start-page: 77 issue: 1 year: 1952 ident: 10.1016/j.artint.2025.104308_br0490 article-title: Portfolio selection publication-title: J. Finance – start-page: 557 year: 2016 ident: 10.1016/j.artint.2025.104308_br0220 article-title: Runtime analysis of evolutionary diversity maximization for OneMinMax – volume: 17 issue: 6 year: 2023 ident: 10.1016/j.artint.2025.104308_br0670 article-title: Bi-objective evolutionary Bayesian network structure learning via skeleton constraint publication-title: Front. Comput. Sci. doi: 10.1007/s11704-023-2740-6 – volume: 6 start-page: 182 issue: 2 year: 2002 ident: 10.1016/j.artint.2025.104308_br0180 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.996017 – volume: 27 start-page: 1288 issue: 5 year: 2023 ident: 10.1016/j.artint.2025.104308_br0250 article-title: A first runtime analysis of the NSGA-II on a multimodal problem publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2023.3250552 – year: 2020 ident: 10.1016/j.artint.2025.104308_br0240 – start-page: 20777 year: 2024 ident: 10.1016/j.artint.2025.104308_br0470 article-title: Towards running time analysis of interactive multi-objective evolutionary algorithms – volume: 80 start-page: 1604 year: 2018 ident: 10.1016/j.artint.2025.104308_br0540 article-title: How to escape local optima in black box optimisation: when non-elitism outperforms elitism publication-title: Algorithmica doi: 10.1007/s00453-017-0369-2 – start-page: 432 year: 2013 ident: 10.1016/j.artint.2025.104308_br0230 article-title: Lower bounds for the runtime of a global multi-objective evolutionary algorithm – start-page: 5657 year: 2023 ident: 10.1016/j.artint.2025.104308_br0650 article-title: A mathematical runtime analysis of the non-dominated sorting genetic algorithm III (NSGA-III) – start-page: 1918 year: 2003 ident: 10.1016/j.artint.2025.104308_br0320 article-title: Expected runtimes of a simple multi-objective evolutionary algorithm – volume: 127 start-page: 57 issue: 1 year: 2001 ident: 10.1016/j.artint.2025.104308_br0350 article-title: Drift analysis and average time complexity of evolutionary algorithms publication-title: Artif. Intell. doi: 10.1016/S0004-3702(01)00058-3 – start-page: 2075 year: 2011 ident: 10.1016/j.artint.2025.104308_br0400 article-title: Fitness-levels for non-elitist populations – volume: 62 start-page: 26 issue: 1 year: 1955 ident: 10.1016/j.artint.2025.104308_br0630 article-title: A remark on Stirling's formula publication-title: Am. Math. Mon. – ident: 10.1016/j.artint.2025.104308_br0730 – volume: 561 start-page: 24 year: 2015 ident: 10.1016/j.artint.2025.104308_br0520 article-title: Population size matters: rigorous runtime results for maximizing the hypervolume indicator publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2014.06.023 – year: 2025 ident: 10.1016/j.artint.2025.104308_br0740 article-title: Approximation guarantees for the non-dominated sorting genetic algorithm II (NSGA-II) publication-title: IEEE Trans. Evol. Comput. – start-page: 428 year: 2022 ident: 10.1016/j.artint.2025.104308_br0040 article-title: Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection – volume: 86 start-page: 396 issue: 2 year: 2024 ident: 10.1016/j.artint.2025.104308_br0410 article-title: More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments publication-title: Algorithmica doi: 10.1007/s00453-022-01044-5 – volume: 67 issue: 2 year: 2024 ident: 10.1016/j.artint.2025.104308_br0680 article-title: Reducing idleness in financial cloud services via multi-objective evolutionary reinforcement learning based load balancer publication-title: Sci. China Inf. Sci. doi: 10.1007/s11432-023-3895-3 – volume: 23 start-page: 543 issue: 4 year: 2015 ident: 10.1016/j.artint.2025.104308_br0310 article-title: Maximizing submodular functions under matroid constraints by evolutionary algorithms publication-title: Evol. Comput. doi: 10.1162/EVCO_a_00159 – start-page: 1682 year: 2021 ident: 10.1016/j.artint.2025.104308_br0370 article-title: A runtime analysis of typical decomposition approaches in MOEA/D framework for many-objective optimization problems – start-page: 651 year: 2008 ident: 10.1016/j.artint.2025.104308_br0080 article-title: Analyzing hypervolume indicator based algorithms – start-page: 667 year: 2010 ident: 10.1016/j.artint.2025.104308_br0510 article-title: How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem – volume: 411 start-page: 854 issue: 6 year: 2010 ident: 10.1016/j.artint.2025.104308_br0290 article-title: Plateaus can be harder in multi-objective optimization publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2009.06.020 – year: 2015 ident: 10.1016/j.artint.2025.104308_br0280 – volume: 75 start-page: 428 year: 2016 ident: 10.1016/j.artint.2025.104308_br0130 article-title: Runtime analysis of non-elitist populations: from classical optimisation to partial information publication-title: Algorithmica doi: 10.1007/s00453-015-0103-x – year: 1989 ident: 10.1016/j.artint.2025.104308_br0340 – start-page: 5522 year: 2023 ident: 10.1016/j.artint.2025.104308_br0090 article-title: The first proven performance guarantees for the non-dominated sorting genetic algorithm II (NSGA-II) on a combinatorial optimization problem – volume: 3 start-page: 257 issue: 4 year: 1999 ident: 10.1016/j.artint.2025.104308_br0790 article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.797969 |
| SSID | ssj0003991 |
| Score | 2.522655 |
| Snippet | Evolutionary algorithms (EAs) have been widely and successfully applied to solve multi-objective optimization problems, due to their nature of population-based... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 104308 |
| Title | Stochastic population update can provably be helpful in multi-objective evolutionary algorithms |
| URI | https://dx.doi.org/10.1016/j.artint.2025.104308 |
| Volume | 341 |
| WOSCitedRecordID | wos001428677500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0004-3702 databaseCode: AIEXJ dateStart: 20211213 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0003991 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT-MwELagcODCGwH7kA_cqiBit3FyRCvQLkIIiYd6i-zEhlRVEkpa4N8zju2kFISWA5eoihLXynwef5l8M4PQQRilgeSB8BJFqQcIgSVFYT3qNHTNb32TW3V7zi4uwsEgurRRpce6nQDL8_D5OSq_1dRwDoytU2e_YO5mUDgBv8HocASzw_G_DH9VFck91-WXu2XTnas7KfWrvdZ4aUnWlIvRS1dI4ImjUquUs9xIC71CDI0L7MqpnabW1fHRXTHOqntb27wpW1srjeq-HzOlPdvAO3ef9Is2QF1MarfPn9oktPPMKPgf3D6qI7HzN9vQBOnPKFqcu-2BBzt6426pKXRlHaava46FH_pyE1YYHtblFLTslfQP28vfls6e29IaoaHTsA1jM0qsR4nNKItoibB-FHbQ0vG_k8FZs4EDZ7ONFs3sXcZlLQt8P5uPGc0MS7leR6v29QIfG1hsoAWZb6I117oDW0--heIWJbhFCTYowYAS7FCChcQWJTjL8RxK8CxKcIuSbXRzenL9569ne214sCT7lReKQDKli-GFqYwEYz4RNFUkDFQgRcQTqRRwTS4pUz6lPcl9olQiieAk6tGU7qBOXuRyF2GRck6AeWpqWpeLE77QrJDA1UDY2R7y3POKS1NSJf7MTnuIuYcaW1po6F4MSPn0zv0v_tMPtNLC-CfqVOOJ_IWWk2mVPY5_W5i8AlCViXc |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Stochastic+population+update+can+provably+be+helpful+in+multi-objective+evolutionary+algorithms&rft.jtitle=Artificial+intelligence&rft.au=Bian%2C+Chao&rft.au=Zhou%2C+Yawen&rft.au=Li%2C+Miqing&rft.au=Qian%2C+Chao&rft.date=2025-04-01&rft.issn=0004-3702&rft.volume=341&rft.spage=104308&rft_id=info:doi/10.1016%2Fj.artint.2025.104308&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_artint_2025_104308 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon |