AnD: a many-objective evolutionary algorithm with angle-based selection and shift-based density estimation
From MaRDI portal
Publication:1999073
Abstract: Evolutionary many-objective optimization has been gaining increasing attention from the evolutionary computation research community. Much effort has been devoted to addressing this issue by improving the scalability of multiobjective evolutionary algorithms, such as Pareto-based, decomposition-based, and indicator-based approaches. Different from current work, we propose a novel algorithm in this paper called AnD, which consists of an angle-based selection strategy and a shift-based density estimation strategy. These two strategies are employed in the environmental selection to delete the poor individuals one by one. Specifically, the former is devised to find a pair of individuals with the minimum vector angle, which means that these two individuals share the most similar search direction. The latter, which takes both the diversity and convergence into account, is adopted to compare these two individuals and to delete the worse one. AnD has a simple structure, few parameters, and no complicated operators. The performance of AnD is compared with that of seven state-of-the-art many-objective evolutionary algorithms on a variety of benchmark test problems with up to 15 objectives. The experimental results suggest that AnD can achieve highly competitive performance. In addition, we also verify that AnD can be readily extended to solve constrained many-objective optimization problems.
Recommendations
- A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation
- Non-dominated sorting on performance indicators for evolutionary many-objective optimization
- An angle dominance criterion for evolutionary many-objective optimization
- A new hypervolume-based differential evolution algorithm for many-objective optimization
- A decomposition based evolutionary algorithm with direction vector adaption and selection enhancement
Cites work
Cited in
(13)- A constraint handling technique using compound distance for solving constrained multi-objective optimization problems
- AREA: an adaptive reference-set based evolutionary algorithm for multiobjective optimisation
- An adaptive clustering-based evolutionary algorithm for many-objective optimization problems
- Analysis on determining the solution of fourth-order fuzzy initial value problem with Laplace operator
- A many-objective optimization integrating open angle based congestion control strategy
- Design and analysis of helper-problem-assisted evolutionary algorithm for constrained multiobjective optimization
- High-dimensional interactive adaptive RVEA for multi-objective optimization of polyester polymerization process
- An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal
- Two-type weight adjustments in MOEA/d for highly constrained many-objective optimization
- A novel policy based on action confidence limit to improve exploration efficiency in reinforcement learning
- Information-decision searching algorithm: theory and applications for solving engineering optimization problems
- -constrained multiobjective differential evolution using linear population size expansion
- A new algorithm for computing priority vector of pairwise comparisons matrix with fuzzy elements
This page was built for publication: AnD: a many-objective evolutionary algorithm with angle-based selection and shift-based density estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999073)
