It is crucial to obtain automatically and efficiently a well-distributed set of Pareto optimal solutions in multiobjective evolutionary algorithms (MOEAs). Many studies have proposed different evolutionary algorithms that can progress toward the Pareto front with a widely spread distribution of solutions. However, most theoretically, convergent MOEAs necessitate certain prior knowledge about the Pareto front in order to efficiently maintain widespread solutions. In this paper, we propose, based on the new E-dominance concept, an Adaptive Rectangle Archiving (ARA) strategy that overcomes this important problem. The MOEA with this archiving technique provably converges to well-distributed Pareto optimal solutions without prior knowledge about the Pareto front. ARA complements the existing archiving techniques and is useful to both researchers and practitioners.
- Evolutionary computation
- diversified archiving
- multiobjective evolutionary algorithms
- ϵ-Pareto set