Abstract
Controlling the dominance area of solutions (CDAS) relaxes the concept of Pareto dominance with an user-defined parameter S. CDAS with S < 0.5 expands the dominance area and improves the search performance of multi-objective evolutionary algorithms (MOEAs) especially in many-objective optimization problems (MaOPs) by enhancing convergence of solutions toward the optimal Pareto front. However, there is a problem that CDAS with an expanded dominance area (S < 0.5) generally cannot approximate entire Pareto front. To overcome this problem we propose an adaptive CDAS (A-CDAS) that adaptively controls the dominance area of solutions during the solutions search. Our method improves the search performance in MaOPs by approximating the entire Pareto front while keeping high convergence. In early generations, A-CDAS tries to converge solutions toward the optimal Pareto front by using an expanded dominance area with S < 0.5. When we detect convergence of solutions, we gradually increase S and contract the dominance area of solutions to obtain Pareto optimal solutions (POS) covering the entire optimal Pareto front. We verify the effectiveness and the search performance of the proposed A-CDAS on concave and convex DTLZ3 benchmark problems with 2–8 objectives, and show that the proposed A-CDAS achieves higher search performance than conventional non-dominated sorting genetic algorithm II (NSGA-II) and CDAS with an expanded dominance area.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have