{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T20:19:01Z","timestamp":1769113141189,"version":"3.49.0"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2021,9,30]]},"abstract":"<jats:p>\n            In\n            <jats:bold>evolutionary multiobjective optimisation<\/jats:bold>\n            (\n            <jats:bold>EMO<\/jats:bold>\n            ), archiving is a common component that maintains an (external or internal) set during the search process, typically with a fixed size, in order to provide a good representation of high-quality solutions produced. Such an archive set can be used solely to store the final results shown to the decision maker, but in many cases may participate in the process of producing solutions (e.g., as a solution pool where the parental solutions are selected). Over the last three decades, archiving stands as an important issue in EMO, leading to the emergence of various methods such as those based on Pareto, indicator, or decomposition criteria. Such methods have demonstrated their effectiveness in literature and have been believed to be good options to many problems, particularly those having a regular Pareto front shape, e.g., a simplex shape.\n          <\/jats:p>\n          <jats:p>In this article, we challenge this belief. We do this through artificially constructing several sequences with extremely simple shapes, i.e., 1D\/2D simplex Pareto front. We show the struggle of predominantly used archiving methods which have been deemed to well handle such shapes. This reveals that the order of solutions entering the archive matters, and that current EMO algorithms may not be fully capable of maintaining a representative population on problems with linear Pareto fronts even in the case that all of their optimal solutions can be found.<\/jats:p>","DOI":"10.1145\/3465335","type":"journal-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T21:19:23Z","timestamp":1629321563000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Is Our Archiving Reliable? Multiobjective Archiving Methods on \u201cSimple\u201d Artificial Input Sequences"],"prefix":"10.1145","volume":"1","author":[{"given":"Miqing","family":"Li","sequence":"first","affiliation":[{"name":"University of Birmingham, Edgbaston, Birmingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31471-6_2"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54157-0_3"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321789"},{"key":"e_1_2_1_5_1","volume-title":"High-Performance Simulation-Based Optimization","author":"Bezerra Leonardo C. T.","unstructured":"Leonardo C. T. Bezerra , Manuel L\u00f3pez-Ib\u00e1\u00f1ez , and Thomas St\u00fctzle . 2020a. Automatic configuration of multi-objective optimizers and multi-objective configuration . In High-Performance Simulation-Based Optimization . Springer , 69\u201392. Leonardo C. T. Bezerra, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, and Thomas St\u00fctzle. 2020a. Automatic configuration of multi-objective optimizers and multi-objective configuration. In High-Performance Simulation-Based Optimization. Springer, 69\u201392."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00263"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2341711"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2019.05.013"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Mexican International Conference on Artificial Intelligence (MICAI\u201904)","author":"Carlos","unstructured":"Carlos A. Coello Coello and Margarita Reyes Sierra. 2004. A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm . In Proceedings of the Mexican International Conference on Artificial Intelligence (MICAI\u201904) . 688\u2013697. Carlos A. Coello Coello and Margarita Reyes Sierra. 2004. A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In Proceedings of the Mexican International Conference on Artificial Intelligence (MICAI\u201904). 688\u2013697."},{"key":"e_1_2_1_10_1","volume-title":"How good is the chord algorithm?SIAM Journal on Computing 45, 3","author":"Daskalakis Constantinos","year":"2016","unstructured":"Constantinos Daskalakis , Ilias Diakonikolas , and Mihalis Yannakakis . 2016. How good is the chord algorithm?SIAM Journal on Computing 45, 3 ( 2016 ), 811\u2013858. Constantinos Daskalakis, Ilias Diakonikolas, and Mihalis Yannakakis. 2016. How good is the chord algorithm?SIAM Journal on Computing 45, 3 (2016), 811\u2013858."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666895"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_2_1_14_1","volume-title":"Scalable test problems for evolutionary multiobjective optimization","author":"Deb Kalyanmoy","unstructured":"Kalyanmoy Deb , Lothar Thiele , Marco Laumanns , and Eckart Zitzler . 2005b. Scalable test problems for evolutionary multiobjective optimization . In Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, Ajith Abraham, Lakhmi Jain, and Robert Goldberg (Eds.). Springer , Berlin, Germany , 105\u2013145. Kalyanmoy Deb, Lothar Thiele, Marco Laumanns, and Eckart Zitzler. 2005b. Scalable test problems for evolutionary multiobjective optimization. In Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, Ajith Abraham, Lakhmi Jain, and Robert Goldberg (Eds.). Springer, Berlin, Germany, 105\u2013145."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9235-0"},{"key":"e_1_2_1_16_1","volume-title":"Adaptive Computing in Design","author":"Everson Richard M.","unstructured":"Richard M. Everson , Jonathan E. Fieldsend , and Sameer Singh . 2002. Full elite sets for multi-objective optimisation . In Adaptive Computing in Design and Manufacture V. Springer , 343\u2013354. Richard M. Everson, Jonathan E. Fieldsend, and Sameer Singh. 2002. Full elite sets for multi-objective optimisation. In Adaptive Computing in Design and Manufacture V. Springer, 343\u2013354."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376916"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071230"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810733"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54157-0_18"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00075"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2433266"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201901)","volume":"2","author":"Ikeda K.","unstructured":"K. Ikeda , H. Kita , and S. Kobayashi . 2001. Failure of Pareto-based MOEAs: Does non-dominated really mean near to optimal? . In Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201901) , Vol. 2 . 957\u2013962. K. Ikeda, H. Kita, and S. Kobayashi. 2001. Failure of Pareto-based MOEAs: Does non-dominated really mean near to optimal?. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201901), Vol. 2. 957\u2013962."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071264"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00226"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 24th European Conference on Artificial Intelligence (ECAI\u201920)","author":"Ishibuchi Hisao","year":"2020","unstructured":"Hisao Ishibuchi , Lie Meng Pang , and Ke Shang . 2020 . A new framework of evolutionary multi-objective algorithms with an unbounded external archive . In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI\u201920) . Hisao Ishibuchi, Lie Meng Pang, and Ke Shang. 2020. A new framework of evolutionary multi-objective algorithms with an unbounded external archive. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI\u201920)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587749"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2799684"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2307319"},{"key":"e_1_2_1_30_1","volume-title":"Metaheuristics for Multiobjective Optimisation","author":"Knowles Joshua","unstructured":"Joshua Knowles and David Corne . 2004. Bounded Pareto archiving: Theory and practice . In Metaheuristics for Multiobjective Optimisation . Springer , 39\u201364. Joshua Knowles and David Corne. 2004. Bounded Pareto archiving: Theory and practice. In Metaheuristics for Multiobjective Optimisation. Springer, 39\u201364."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810755"},{"key":"e_1_2_1_33_1","volume-title":"Congress on Evolutionary Computation (CEC)","volume":"4","author":"Knowles Joshua D.","year":"2003","unstructured":"Joshua D. Knowles , David W. Corne , and Mark Fleischer . 2003 . Bounded archiving using the Lebesgue measure . In Congress on Evolutionary Computation (CEC) , Vol. 4 . IEEE, 2490\u20132497. Joshua D. Knowles, David W. Corne, and Mark Fleischer. 2003. Bounded archiving using the Lebesgue measure. In Congress on Evolutionary Computation (CEC), Vol. 4. IEEE, 2490\u20132497."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908961.2931699"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_56"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645821.670214"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234108"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.03.039"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2855411"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2655451"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2262178"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2504730"},{"key":"e_1_2_1_43_1","volume-title":"International Conference on Evolutionary Multi-Criterion Optimization. Springer, 15\u201326","author":"Li Miqing","year":"2019","unstructured":"Miqing Li and Xin Yao . 2019 a. An empirical investigation of the optimality and monotonicity properties of multiobjective archiving methods . In International Conference on Evolutionary Multi-Criterion Optimization. Springer, 15\u201326 . Miqing Li and Xin Yao. 2019a. An empirical investigation of the optimality and monotonicity properties of multiobjective archiving methods. In International Conference on Evolutionary Multi-Criterion Optimization. Springer, 15\u201326."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3300148"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00269"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987637.1987642"},{"key":"e_1_2_1_48_1","volume-title":"International Conference on Parallel Problem Solving from Nature. Springer, 621\u2013630","author":"L\u00f3pez-Ib\u00e1\u00f1ez Manuel","year":"2014","unstructured":"Manuel L\u00f3pez-Ib\u00e1\u00f1ez , Arnaud Liefooghe , and S\u00e9bastien Verel . 2014 . Local optimal sets and bounded archiving on multi-objective NK-landscapes with correlated objectives . In International Conference on Parallel Problem Solving from Nature. Springer, 621\u2013630 . Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Arnaud Liefooghe, and S\u00e9bastien Verel. 2014. Local optimal sets and bounded archiving on multi-objective NK-landscapes with correlated objectives. In International Conference on Parallel Problem Solving from Nature. Springer, 621\u2013630."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-009-9103-9"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760102.1760142"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.910138"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 2000 Congress on Evolutionary Computation","volume":"2","author":"Rudolph G\u00fcnter","year":"2000","unstructured":"G\u00fcnter Rudolph and Alexandru Agapie . 2000 . Convergence properties of some multi-objective evolutionary algorithms . In Proceedings of the 2000 Congress on Evolutionary Computation , Vol. 2 . IEEE, 1010\u20131016. G\u00fcnter Rudolph and Alexandru Agapie. 2000. Convergence properties of some multi-objective evolutionary algorithms. In Proceedings of the 2000 Congress on Evolutionary Computation, Vol. 2. IEEE, 1010\u20131016."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9815-8"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9265-7"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.02.023"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2751071"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3079192"},{"key":"e_1_2_1_58_1","volume-title":"2019 IEEE Congress on Evolutionary Computation (CEC\u201919)","author":"Wang Hao","year":"2019","unstructured":"Hao Wang , Chaoli Sun , Yaochu Jin , Shufen Qin , and Haibo Yu . 2019 . A multi-indicator based selection strategy for evolutionary many-objective optimization . In 2019 IEEE Congress on Evolutionary Computation (CEC\u201919) . IEEE, 2042\u20132049. Hao Wang, Chaoli Sun, Yaochu Jin, Shufen Qin, and Haibo Yu. 2019. A multi-indicator based selection strategy for evolutionary many-objective optimization. In 2019 IEEE Congress on Evolutionary Computation (CEC\u201919). IEEE, 2042\u20132049."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2227145"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_2_1_61_1","volume-title":"Working Report CES-487. School of CS & EE","author":"Zhang Q.","year":"2009","unstructured":"Q. Zhang , A. Zhou , S. Zhao , P. N. Suganthan , W. Liu , and S. Tiwari . 2009 . Multiobjective Optimization Test Instances for the CEC 2009 Special Session and Competition . Working Report CES-487. School of CS & EE , University of Essex. Q. Zhang, A. Zhou, S. Zhao, P. N. Suganthan, W. Liu, and S. Tiwari. 2009. Multiobjective Optimization Test Instances for the CEC 2009 Special Session and Competition. Working Report CES-487. School of CS & EE, University of Essex."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"e_1_2_1_63_1","unstructured":"Eckart Zitzler Marco Laumanns and Lothar Thiele. 2002. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In Evolutionary Methods for Design Optimisation and Control. 95\u2013100.  Eckart Zitzler Marco Laumanns and Lothar Thiele. 2002. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In Evolutionary Methods for Design Optimisation and Control. 95\u2013100."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:11Z","timestamp":1750191431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9,30]]}},"alternative-id":["10.1145\/3465335"],"URL":"https:\/\/doi.org\/10.1145\/3465335","relation":{},"ISSN":["2688-299X","2688-3007"],"issn-type":[{"value":"2688-299X","type":"print"},{"value":"2688-3007","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"2020-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}