Kensuke Kano
ABSTRACT
This work proposes a method to adaptively determine the grid granularity for the grid decomposition-based evolutionary algorithm for many-objective optimization. The decomposition of the objective space is one of the promising approaches for evolutionary many-objective optimization. Although the weight-based decomposition is frequently employed recently, it has been known that the grid-based decomposition is also effective for many-objective optimization. The grid-based evolutionary algorithm (GrEA) decomposes the objective space into a grid environment with the grid division parameter. The grid division parameter determines the grid granularity and affects search performance. To find out an appropriate grid division parameter, we need to perform a parameter tuning, which executes multiple runs with different parameters and is generally time-consuming. In this work, we propose an adaptive GrEA (A-GrEA) automatically determines the grid division parameter during a single run of the search. Experimental results using WFG variant problems with 6 to 10 objectives show that the proposed A-GrEA does not only to determine the grid division parameter adaptively but also achieves comparative or higher search performance than the conventional GrEA with the best grid division parameter, MOEA/D, and NSGA-III.
- K. Deb, Multi-Objective Optimization using Evolutionary Algorithms, John Wiley & Sons, 2001.Google Scholar
Digital Library
- C. A. C. Coello, D. A. V. Veldhuizen, and G. B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems, Boston, Kluwer Academic Publishers, 2002.Google ScholarDigital Library
- Q. Zhang and H. Li, "MOEA/D: A Multi-objective Evolutionary Algorithm Based on Decomposition," IEEE Trans. on Evolutionary Computation, Vol. 11, No. 6, pp.712--731, 2007.Google ScholarDigital Library
- K. Deb, H. Jain, "An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, Part I: Solving problems with box constraints," IEEE Trans. on Evolutionary Computation, Vol. 18, No. 4, pp. 577--601, 2014.Google ScholarCross Ref
- K. Li, K. Deb, Q. Zhang, and S. Kwong, "An evolutionary many-objective optimization algorithm based on dominance and decomposition," IEEE Trans. on Evolutionary Computation, Vol. 19, No. 5, pp. 694--716, 2015.Google ScholarDigital Library
- Y. Yuan, H. Xu, B. Wang, X. Yao, "A new dominance relation-based evolutionary algorithm for many-objective optimization," IEEE Trans. on Evolutionary Computation, Vol. 20, No.1, pp. 16--37, 2016.Google ScholarDigital Library
- S. Yang, M. Li, X. Liu, and J. Zheng, "A grid-based evolutionary algorithm for many-objective optimization," IEEE Trans. on Evolutionary Computation, Vol. 17, No. 5, pp. 721--736, 2013.Google ScholarDigital Library
- H. Sato, "Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs," Journal of Heuristics, Vol. 21, Issue 6, pp. 819--849, 2016.Google ScholarDigital Library
- Y. Tian, R. Cheng, X. Zhang, and Y. Jin, "PlatEMO: A MATLAB platform for evolutionary multi-objective optimization [educational forum]," IEEE Computational Intelligence Magazine, Vol. 12, No. 4, pp. 73--87, 2017.Google ScholarDigital Library
- S. Huband, P. Hingston, L. Barone, and L. While, "A Review of Multi-objective Test Problems and a Scalable Test Problem Toolkit," IEEE Trans. on Evolutionary Computation, Vol. 10, No. 5, pp. 477--506, 2006.Google ScholarDigital Library
- E. Zitzler, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications, PhD thesis, Swiss Federal Institute of Technology, Zurich, 1999.Google Scholar
Index Terms
- Preliminary study of adaptive grid-based decomposition on many-objective evolutionary optimization
Recommendations
A new adaptive decomposition-based evolutionary algorithm for multi- and many-objective optimization
Highlights- An adaptive decomposition approach is proposed to guide the evolution process.
- ...
AbstractIn decomposition-based multi-objective evolutionary algorithms (MOEAs), a set of uniformly distributed reference vectors (RVs) is usually adopted to decompose a multi-objective optimization problem (MOP) into several single-objective ...
Nadir point estimation for many-objective optimization problems based on emphasized critical regions
Nadir points play an important role in many-objective optimization problems, which describe the ranges of their Pareto fronts. Using nadir points as references, decision makers may obtain their preference information for many-objective optimization ...
An Objective Reduction Evolutionary Multiobjective Algorithm using Adaptive Density-Based Clustering for Many-objective Optimization Problem
CACML '23: Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine LearningMany-objective optimization problems (MaOPs), are the most difficult problems to solve when it comes to multiobjective optimization issues (MOPs). MaOPs provide formidable challenges to current multiobjective evolutionary methods such as selection ...
Comments