7,902 research outputs found
Recommended from our members
A scalar projection and angle based evolutionary algorithm for many-objective optimization problems
In decomposition-based multi-objective evolutionary algorithms, the setting of search directions (or weight vectors), and the choice of reference points (i.e., the ideal point or the nadir point) in scalarizing functions, are of great importance to the performance of the algorithms. This paper proposes a new decomposition-based many-objective optimizer by simultaneously using adaptive search directions and two reference points. For each parent, binary search directions are constructed by using its objective vector and the above two reference points. Each individual is simultaneously evaluated on two fitness functions—which are motivated by scalar projections—that are deduced to be the differences between two penalty-based boundary intersection (PBI) functions, and two inverted PBI functions, respectively. Solutions with the best value on each fitness function are emphasized. Moreover, an angle-based elimination procedure is adopted to select diversified solutions for the next generation. The use of adaptive search directions aims at effectively handling problems with irregular Pareto-optimal fronts, and the philosophy of using the ideal and nadir points simultaneously is to take advantages of the complementary effects of the two points when handling problems with either concave or convex fronts. The performance of the proposed approach is compared with seven state-of-the-art multi-/many-objective evolutionary algorithms on 32 test problems with up to 15 objectives. It is shown by the experimental results that the proposed algorithm is flexible when handling problems with different types of Pareto-optimal fronts, obtaining promising results regarding both the quality of the returned solution set and the efficiency of the new algorithm
An adaptation reference-point-based multiobjective evolutionary algorithm
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.It is well known that maintaining a good balance between convergence and diversity is crucial to the performance of multiobjective optimization algorithms (MOEAs). However, the Pareto front (PF) of multiobjective optimization problems (MOPs) affects the performance of MOEAs, especially reference point-based ones. This paper proposes a reference-point-based adaptive method to study the PF of MOPs according to the candidate solutions of the population. In addition, the proportion and angle function presented selects elites during environmental selection. Compared with five state-of-the-art MOEAs, the proposed algorithm shows highly competitive effectiveness on MOPs with six complex characteristics
Generalized decomposition and cross entropy methods for many-objective optimization
Decomposition-based algorithms for multi-objective
optimization problems have increased in popularity in the past decade. Although their convergence to the Pareto optimal front (PF) is in several instances superior to that of Pareto-based algorithms, the problem of selecting a way to distribute or guide these solutions in a high-dimensional space has not been explored. In this work, we introduce a novel concept which we call generalized
decomposition. Generalized decomposition provides a framework with which the decision maker (DM) can guide the underlying evolutionary algorithm toward specific regions of interest or the entire Pareto front with the desired distribution of Pareto optimal solutions. Additionally, it is shown that generalized decomposition simplifies many-objective problems by unifying the three performance objectives of multi-objective evolutionary algorithms – convergence to the PF, evenly distributed Pareto
optimal solutions and coverage of the entire front – to only one, that of convergence. A framework, established on generalized decomposition, and an estimation of distribution algorithm (EDA) based on low-order statistics, namely the cross-entropy method (CE), is created to illustrate the benefits of the proposed concept for many objective problems. This choice of EDA also enables
the test of the hypothesis that low-order statistics based EDAs can have comparable performance to more elaborate EDAs
- …