Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Evolutionary Computation
Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II
IEEE Transactions on Evolutionary Computation
Research frontier: memetic computation-past, present & future
IEEE Computational Intelligence Magazine
Exploring e-learning knowledge through ontological memetic agents
IEEE Computational Intelligence Magazine
Generalizing surrogate-assisted evolutionary computation
IEEE Transactions on Evolutionary Computation
Hype: An algorithm for fast hypervolume-based many-objective optimization
Evolutionary Computation
Evolutionary multi-objective optimization: a historical view of the field
IEEE Computational Intelligence Magazine
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Classification of adaptive memetic algorithms: a comparative study
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
A core challenge of Multiobjective Evolutionary Algorithms (MOEAs) is to attain evenly distributed Pareto optimal solutions along the Pareto front. In this paper, we propose a novel asymmetric Pareto-adaptive (apa ) scheme for the identification of well distributed Pareto optimal solutions based on the geometrical characteristics of the Pareto front. The apa scheme applies to problem with symmetric and asymmetric Pareto fronts. Evaluation on multiobjective problems with Pareto fronts of different forms confirms that apa improves both convergence and diversity of the classical decomposition-based (MOEA/D) and Pareto dominance-based MOEAs (paε -MyDE).