We consider algorithms for the sequential storage, or ‘archiving’, of solutions discovered during a Pareto optimization procedure. We focus particularly on the case when an a priori hard bound, N,is placed on the capacity of the archive of solutions. We show that for general sequences of points, no algorithm that respects the bound can maintain an ideal minimumnumber of points in the archive. One consequence of this, for example, is that a strictly bounded archive cannot be expected in general to contain the Pareto front of the points generated so far (where this set is smaller than the archive bound). Using the notion of an ideal e-approximation set—the subset (of size ≤ N)of a whole sequence of points which minimizes e—we also show that no archiving algorithm can attain this ideal for general sequences. This means that in general no archiving algorithm can be expected to maintain an ‘optimal’ representation of the Pareto front when the size of that set is larger than the archive bound. Furthermore, if the ranges of the PF of the sequence are not known a priori, no algorithm that certifies (using its own internal epsilon parameter e arc ) that it maintains an epsilon-approximate set of the sequence, can maintain e arc )within any fixed multiple of the minimal (ideal) e value. In a case study we go on to demonstrate several scenarios where e-based archiving algorithms proposed by Laumanns et al. — which perform well when the archive’s capacity is nota priori bounded—perform poorly when e is adapted ‘on the fly’ in order to respect a capacity constraint. For each scenario we demonstrate that the performance of an adaptive grid archiving (AGA) algorithm (which does notassure a formally guaranteed approximation level) performs comparatively well, in practice.
[1]
Martin J. Oates,et al.
PESA-II: region-based selection in evolutionary multiobjective optimization
,
2001
.
[2]
Marco Laumanns,et al.
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
,
2002,
Evolutionary Computation.
[3]
Günter Rudolph,et al.
Convergence properties of some multi-objective evolutionary algorithms
,
2000,
Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[4]
Marco Laumanns,et al.
Archiving With Guaranteed Convergence And Diversity In Multi-objective Optimization
,
2002,
GECCO.
[5]
David W. Corne,et al.
Properties of an adaptive archiving algorithm for storing nondominated vectors
,
2003,
IEEE Trans. Evol. Comput..
[6]
Joshua D. Knowles.
Local-search and hybrid evolutionary algorithms for Pareto optimization
,
2002
.
[7]
Mark Fleischer,et al.
The measure of pareto optima: Applications to multi-objective metaheuristics
,
2003
.
[8]
Marco Laumanns,et al.
On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms
,
2001
.
[9]
Marco Laumanns,et al.
Why Quality Assessment Of Multiobjective Optimizers Is Difficult
,
2002,
GECCO.
[10]
Eckart Zitzler,et al.
Evolutionary algorithms for multiobjective optimization: methods and applications
,
1999
.
[11]
M. Hansen,et al.
Evaluating the quality of approximations to the non-dominated set
,
1998
.