Wentao Guo
ABSTRACT
A non-dominated sorting differential evolution algorithm with improved directional convergence and spread (NSDE-IDCS) is developed. Taking advantage of differential evolution, searching direction for a dominated solution is determined by its nearest non-dominated neighbor, while searching direction for a non-dominated solution is determined by other two non-dominated solutions. A simplex local search operator with an adaptive search probability is embedded to further exploit the neighborhood of non-dominated solutions.
- A. W. Iorio and X. Li. Incorporating directional information within a differential evolution algorithm for multi-objective optimization. In Proc. Genetic Evol. Comput. Conf., pages 691--698, 2006. Google Scholar
Digital Library
- S. Z. Martinez and C. A. C. Coello. A direct local search mechanism for decomposition-based multi-objective evolutionary algorithms. In Proc. IEEE Cong. Evol. Comput., pages 1--8, 2012.Google ScholarCross Ref
- E. Mezura-Montes, M. Reyes-Sierra, and C. A. C. Coello. Multi-objective optimization using differential evolution: a survey of the state-of-the-art. Advances in differential evolution, 143:173--196, 2008.Google Scholar
Index Terms
- Non-dominated sorting differential evolution with improved directional convergence and spread for multiobjective optimization
Recommendations
Evolutionary multiobjective optimization
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationMany optimization problems are multiobjective in nature in the sense that multiple, conflicting criteria need to be optimized simultaneously. Due to the conflict between objectives, usually, no single optimal solution exists. Instead, the optimum ...
Approximate non-dominated sorting for evolutionary many-objective optimization
Non-dominated sorting has widely been adopted and shown to be very effective in dominance based evolutionary multi-objective optimization where the number of objectives is two or three. In dealing with many-objective optimization problems, where the ...
Zigzag Search for Continuous Multiobjective Optimization
<P>A new method is proposed using a gradient-based zigzag search approach for multiobjective optimization (MOO) or vector optimization problems. The key idea of this method is searching around the Pareto front by applying an efficient local search ...
Comments