Impact of selection methods on the diversity of many-objective Pareto set approximations
نویسندگان
چکیده
Selection methods are a key component of all multi-objective and, consequently, many-objective optimisation evolutionary algorithms. They must perform two main tasks simultaneously. First of all, they must select individuals that are as close as possible to the Pareto optimal front (convergence). Second, but not less important, they must help the evolutionary approach to provide a diverse population. In this paper, we carry out a comprehensive analysis of state-of-the-art selection methods with different features aimed to determine the impact that this component has on the diversity preserved by well-known multi-objective optimisers when dealing with many-objective problems. The algorithms considered herein, which incorporate Pareto-based and indicatorbased selection schemes, are analysed through their application to the Walking Fish Group (WFG) test suite taking into account an increasing number of objective functions. Algorithmic approaches are assessed via a set of performance indicators specifically proposed for measuring the diversity of a solution set, such as the Diversity Measure and the Diversity Comparison Indicator. Hyper-volume, which measures convergence in addition to diversity, is also used for comparison purposes. The experimental evaluation points out that the reference-point-based selection scheme of the Non-dominated Sorting Genetic Algorithm III (NSGA-III) and a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA-II), where the the crowding distance is replaced by the Euclidean distance, yield the best results. c © 2017 The Authors. Published by Elsevier B.V. Peer-review under responsibility of KES International.
منابع مشابه
Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
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 approximations by using different diversity mechanisms. We discuss some well-known approaches such as the d...
متن کامل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 approximations by using different diversity mechanisms. We discuss some well-known approaches such as the d...
متن کاملDYNAMIC PERFORMANCE OPTIMIZATION OF TRUSS STRUCTURES BASED ON AN IMPROVED MULTI-OBJECTIVE GROUP SEARCH OPTIMIZER
This paper presents an improved multi-objective group search optimizer (IMGSO) that is based on Pareto theory that is designed to handle multi-objective optimization problems. The optimizer includes improvements in three areas: the transition-feasible region is used to address constraints, the Dealer’s Principle is used to construct the non-dominated set, and the producer is updated using a tab...
متن کاملAn Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization
This work studies the behavior of three elitist multiand many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set. Several search-assessment indicators are defined to trace the dynamics of survival selection and measure the ability to simultaneously keep optimal solutions and discover new ones under different population sizes, set as a fraction...
متن کامل