39,272 research outputs found
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 indicator-based 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
Inheritance-Based Diversity Measures for Explicit Convergence Control in Evolutionary Algorithms
Diversity is an important factor in evolutionary algorithms to prevent
premature convergence towards a single local optimum. In order to maintain
diversity throughout the process of evolution, various means exist in
literature. We analyze approaches to diversity that (a) have an explicit and
quantifiable influence on fitness at the individual level and (b) require no
(or very little) additional domain knowledge such as domain-specific distance
functions. We also introduce the concept of genealogical diversity in a broader
study. We show that employing these approaches can help evolutionary algorithms
for global optimization in many cases.Comment: GECCO '18: Genetic and Evolutionary Computation Conference, 2018,
Kyoto, Japa
On the evolutionary optimisation of many conflicting objectives
This inquiry explores the effectiveness of a class of modern evolutionary algorithms, represented by Non-dominated Sorting Genetic Algorithm (NSGA) components, for solving optimisation tasks with many conflicting objectives. Optimiser behaviour is assessed for a grid of mutation and recombination operator configurations. Performance maps are obtained for the dual aims of
proximity to, and distribution across, the optimal trade-off surface. Performance sweet-spots for both variation operators are observed to contract as the number of objectives is increased. Classical settings for recombination are shown to be suitable for small numbers of objectives but correspond to very poor performance for higher numbers of objectives, even when large population
sizes are used. Explanations for this behaviour are offered via the concepts of dominance resistance and active diversity promotion
A test problem for visual investigation of high-dimensional multi-objective search
An inherent problem in multiobjective optimization is that the visual observation of solution vectors with four or more objectives is infeasible, which brings major difficulties for algorithmic design, examination, and development. This paper presents a test problem, called the Rectangle problem, to aid the visual investigation of high-dimensional multiobjective search. Key features of the Rectangle problem are that the Pareto optimal solutions 1) lie in a rectangle in the two-variable decision space and 2) are similar (in the sense of Euclidean geometry) to their images in the four-dimensional objective space. In this case, it is easy to examine the behavior of objective vectors in terms of both convergence and diversity, by observing their proximity to the optimal rectangle and their distribution in the rectangle, respectively, in the decision space. Fifteen algorithms are investigated. Underperformance of Pareto-based algorithms as well as most state-of-the-art many-objective algorithms indicates that the proposed problem not only is a good tool to help visually understand the behavior of multiobjective search in a high-dimensional objective space but also can be used as a challenging benchmark function to test algorithms' ability in balancing the convergence and diversity of solutions
- …