Haitham Ahmed Seada
ABSTRACT
In EMO diversity of the obtained solutions is an important factor, particularly for decision makers. NSGA-III is a recently proposed reference direction based algorithm that was shown to be successful up to as many as 15 objectives. In this study, we propose a diversity enhanced version of NSGA-III. Our algorithm augments NSGA-III with two types of local search. The first aims at finding the true extreme points of the Pareto front, while the second targets internal points. The two local search optimizers are carefully weaved into the fabric of NSGA-III niching procedure. The final algorithm maintains the total number of function evaluations to a minimum, enables using small population sizes, and achieves higher diversity without sacrificing convergence on a number of multi and many-objective problems.
- P. A. Bosman. On gradients and hybrid evolutionary algorithms for real-valued multiobjective optimization. Evolutionary Computation, IEEE Transactions on, 16(1):51--69, 2012. Google Scholar
Digital Library
- K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. Lecture notes in computer science, 1917:849--858, 2000. Google ScholarDigital Library
- K. Deb and H. Jain. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. Evolutionary Computation, IEEE Transactions on, 18(4):577--601, 2014.Google Scholar
- H. Ishibuchi and T. Murata. A multi-objective genetic local search algorithm and its application to flowshop scheduling. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, 28(3):392--403, 1998. Google ScholarDigital Library
- V. Khare, X. Yao, and K. Deb. Performance scaling of multi-objective evolutionary algorithms. In Evolutionary Multi-Criterion Optimization, pages 376--390. Springer, 2003. Google ScholarDigital Library
- K. Sindhya, K. Deb, and K. Miettinen. A local search based evolutionary multi-objective optimization approach for fast and accurate convergence. In Parallel Problem Solving from Nature-PPSN X, pages 815--824. Springer, 2008.Google Scholar
- Q. Zhang and H. Li. Moea/d: A multiobjective evolutionary algorithm based on decomposition. Evolutionary Computation, IEEE Transactions on, 11(6):712--731, 2007. Google ScholarDigital Library
- E. Zitzler, M. Laumanns, L. Thiele, E. Zitzler, E. Zitzler, L. Thiele, and L. Thiele. Spea2: Improving the strength pareto evolutionary algorithm, 2001.Google Scholar
Index Terms
- Towards a Better Diversity of Evolutionary Multi-Criterion Optimization Algorithms using Local Searches
Recommendations
Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search
Evolutionary multi-criterion optimization (EMO) algorithms emphasize non-dominated and less crowded solutions in a population iteratively until the population converges close to the Pareto optimal set. During the search process, non-dominated solutions ...
Evolutionary multi-objective optimisation by diversity control
CSR'06: Proceedings of the First international computer science conference on Theory and ApplicationsThis paper presents an improved multi-objective diversity control oriented genetic algorithm (MODCGA-II). The performance comparison between the MODCGA-II, a non-dominated sorting genetic algorithm II (NSGA-II) and an improved strength Pareto ...
Multiobjective Optimization and Hybrid Evolutionary Algorithm to Solve Constrained Optimization Problems
This paper presents a novel evolutionary algorithm (EA) for constrained optimization problems, i.e., the hybrid constrained optimization EA (HCOEA). This algorithm effectively combines multiobjective optimization with global and local search models. In ...
Comments