Multi-Objective Archiving
- 12 September 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 28 (3) , 696-717
Abstract
Most multi-objective optimisation algorithms maintain an archive explicitly or implicitly during their search. Such an archive can be solely used to store high-quality solutions presented to the decision maker, but in many cases may participate in the search process (e.g., as the population in evolutionary computation). Over the last two decades, archiving, the process of comparing new solutions with previous ones and deciding how to update the archive/population, stands as an important issue in evolutionary multi-objective optimisation (EMO). This is evidenced by constant efforts from the community on developing various effective archiving methods, ranging from conventional Pareto-based methods to more recent indicator-based and decomposition-based ones. However, the focus of these efforts is on empirical performance comparison in terms of specific quality indicators; there is lack of systematic study of archiving methods from a general theoretical perspective. In this paper, we attempt to conduct a systematic overview of multi-objective archiving, in the hope of paving the way to understand archiving algorithms from a holistic perspective of theory and practice, and more importantly providing a guidance on how to design theoretically desirable and practically useful archiving algorithms. In doing so, we also present that archiving algorithms based on weakly Pareto compliant indicators (e.g., -indicator), as long as designed properly, can achieve the same theoretical desirables as archivers based on Pareto compliant indicators (e.g., hypervolume indicator). Such desirables include the property limit-optimal, the limit form of the possible optimal property that a bounded archiving algorithm can have with respect to the most general form of superiority between solution sets.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (62250710682)
- Research Institute of Trustworthy Autonomous Systems
- Guangdong Provincial Key Laboratory (2020B121201001)
- Program for Guangdong Introducing Innovative and Entrepreneurial Teams (2017ZT07X386)
This publication has 169 references indexed in Scilit:
- Archivers for the representation of the set of approximate solutions for MOPsJournal of Heuristics, 2018
- A tutorial on multiobjective optimization: fundamentals and evolutionary methodsNatural Computing, 2018
- A Study of Archiving Strategies in Multi-objective PSO for Molecular Docking2016
- Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical resultsComputational Optimization and Applications, 2015
- Modified Distance Calculation in Generational Distance and Inverted Generational Distance2015
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problemsJournal of Heuristics, 2011
- Improving the anytime behavior of two-phase local searchAnnals of Mathematics and Artificial Intelligence, 2011
- Two-phase Pareto local search for the biobjective traveling salesman problemJournal of Heuristics, 2009
- Convergence of stochastic search algorithms to finite size pareto set approximationsJournal of Global Optimization, 2008
- Online algorithms: a surveyMathematical Programming, 2003