Approximating pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization

摘要

Often the Pareto front of a multi-objective optimization problem grows exponentially with the problem size. In this case, it is not possible to compute the whole Pareto front efficiently and one is interested in good approximations. We consider how evolutionary algorithms can achieve such an approximation by using different diversity mechanisms. We discuss some well-known approaches such as the density estimator and the ε -dominance approach and point out when and how such mechanisms provably help to obtain a good approximation of the Pareto-optimal set.