Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms

Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was oil obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of (sic)-dominance. Though bounds on the quality of the limit approximition-which are entirely determined by the archiving strategy and the value of (sic)-have been obtained, the strategies do not guarantee to obtain a gap free approximation of the Pareto front. That is, such approximations A can reveal gaps in the sense that point f in the Pareto front can exist such that the distance of f to any image point F(a), a is an element of A, is "large." Since such gap free approximations are desirable in certain applications, and the related archiving strategies call be advantageous when memetic strategies are included in the search process, we are aiming in this work for such methods. We present two novel strategies that accomplish this task in the probabilistic sense and under mild assumptions on the stochastic search algorithm. In addition to the convergence proofs, we give some numerical results to visualize the behavior of the different archiving strategies. Finally, we demonstrate the potential for a possible hybridization of a given stochastic search algorithm with a particular local search strategy-multi-objective continuation methods-by showing that the concept of (sic)-dominance can be integrated into this approach in a suitable way.