Login Register Cart 0
Generic placeholder image

The Chinese Journal of Artificial Intelligence

Editor-in-Chief

ISSN (Print): 2666-7827
ISSN (Online): 2666-7835

Back
Journal Home About Journal Editorial Board Current Issue Volumes/Issues
Subscribe
Research Article

A Many-Objective Evolutionary Algorithm Based on Two-Phase Selection

Author(s): Erchao Li* and Li-sen Wei

Volume 1, Issue 1, 2022

Published on: 07 July, 2021

Article ID: e070721194579 Pages: 17

DOI: 10.2174/2666782701666210707144755

Abstract

Aims: The main purpose of this paper is to achieve good convergence and distribution in different Pareto fronts.

Background: Research in recent decades has shown that evolutionary multi-objective optimization can effectively solve multi-objective optimization problems with no more than 3 targets. However, when solving MaOPs, the traditional evolutionary multi-objective optimization algorithm is difficult to effectively balance convergence and diversity. In order to solve these problems, many algorithms have emerged, which can be roughly divided into the following three types: decomposition-based, indexbased, and dominance relationship-based. In addition, there are many algorithms that introduce the idea of clustering into the environment. However, there are some disadvantages to solving different types of MaOPs. In order to take advantage of the above algorithms, this paper proposes a manyobjective optimization algorithm based on two-phase evolutionary selection.

Objective: In order to verify the comprehensive performance of the algorithm on the testing problem of different Pareto front, 18 examples of regular PF problems and irregular PF problems are used to test the performance of the algorithm proposed in this paper.

Method: This paper proposes a two-phase evolutionary selection strategy. The evolution process is divided into two phases to select individuals with good quality. In the first phase, the convergence area is constructed by indicators to accelerate the convergence of the algorithm. In the second phase, the parallel distance is used to map the individuals to the hyperplane, and the individuals are clustered according to the distance on the hyperplane, and then the smallest fitness in each category is selected.

Result: For regular Pareto front testing problems, MaOEA/TPS performed better than RVEA, PREA, CAMOEA and One by one EA in 19, 21, 30, 26 cases, respectively, while it was only outperformed by RVEA, PREA, CAMOEA and One by one EA in 8, 5, 1, and 6 cases. For the irregular front testing problem, MaOEA/TPS performed better than RVEA, PREA, CAMOEA and One by one EA in 20, 17, 25, and 21 cases, respectively, while it was only outperformed by RVEA, PREA, CAMOEA and One by one EA in 6, 8, 1, and 6 cases.

Conclusion: The paper proposes a many-objective evolutionary algorithm based on two phase selection, termed MaOEA/TPS, for solving MaOPs with different shapes of Pareto fronts. The results show that MaOEA/TPS has quite a competitive performance compared with the several algorithms on most test problems.

Other: Although the algorithm in this paper has achieved good results, the optimization problem in the real environment is more difficult, therefore, applying the algorithm proposed in this paper to real problems will be the next research direction.

Keywords: MaOPs, MaOEA/TPS, parallel distance similarity, clusters, diversity, convergence.

Graphical Abstract

[1]
Wang R, Purshouse RC, Fleming PJ. Preference-inspired co-evolutionary algorithm using adaptively generated goal vectors. IEEE Congress on Evolutionary Computation. 2013 June 20-23; Cancun, Mexico IEEE 2013.
[http://dx.doi.org/10.1109/CEC.2013.6557665]
[2]
Zhou Y, Wang J. “A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows,” IEEE Syst. J., vol. 9, no. 3, pp. 1100-1113, Sep. 201.
[3]
Deb K, Jain H. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 2013; 18(4): 577-601.
[http://dx.doi.org/10.1109/TEVC.2013.2281535]
[4]
Sundaram E, Gunasekaran M, Krishnan R, et al. Genetic algorithm based reference current control extraction based shunt active power filter. Intern Trans on Elec Energy Sys 2021; 31(1): e12623.
[http://dx.doi.org/10.1002/2050-7038.12623]
[5]
Sun J, Gong DW. Recent advances in evolutionary many-objective optimization. Contr Theory App 2018; 35(07): 928-38.
[6]
Guo XT, Li LY, Zhu CY. Two phase many-objective optimization algorithm based on pareto dominance relationship. J Front Comput Sci Technol 2018; 12(08): 1350-60.
[7]
Bi XJ, Zhang YJ, Chen CY. A many-objective evolutionary algorithm based on fuzzy dominance: MFEA. Tien Tzu Hsueh Pao 2014; 42(08): 1653-9.
[http://dx.doi.org/10.3969/j.issn.0372-2112.2014.08.031]
[8]
Yang S, Li M, Liu X, et al. A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 2013; 17(5): 721-36.
[http://dx.doi.org/10.1109/TEVC.2012.2227145]
[9]
Yuan Y, Xu H, Wang B, et al. A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 2015; 20(1): 16-37.
[http://dx.doi.org/10.1109/TEVC.2015.2420112]
[10]
Liang Z, Luo T, Hu K, Ma X, Zhu Z. An indicator-based many-objective evolutionary algorithm with boundary protection. IEEE Trans Cybern 2020; 51(9): 4553-66.
[http://dx.doi.org/10.1109/TCYB.2019.2960302] [PMID: 31940581]
[11]
He X, Zhou Y, Chen Z, et al. Evolutionary many-objective optimization based on dynamical decomposition. IEEE Trans Evol Comput 2018; 23(3): 361-75.
[http://dx.doi.org/10.1109/TEVC.2018.2865590]
[12]
Zhang Q, Li H. MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 2007; 11(6): 712-31.
[http://dx.doi.org/10.1109/TEVC.2007.892759]
[13]
Hoare C A R. Algorithm 65: find. Commun ACM 1961; 4(7): 321-2.
[14]
Wu Y, Wang X, Fu Y, et al. Many-objective brain storm optimization algorithm. IEEE Access 2019; 7: 186572-86.
[http://dx.doi.org/10.1109/ACCESS.2019.2960874]
[15]
Yuan J, Liu HL, Gu F, et al. Investigating the properties of indicators and an evolutionary many-objective algorithm based on a promising region. IEEE Trans Evol Comput 2020; 25(1): 75-86.
[16]
Hernandez Gomez R, Coello Coello CA. Improved metaheuristic based on the R2 indicator for many-objective optimization. Proc Ann Conf Gen Evol Comput 2015; 679-86.
[http://dx.doi.org/10.1145/2739480.2754776]
[17]
Sun Y, Yen GG, Yi Z. IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 2018; 23(2): 173-87.
[18]
Li J, Chen G, Li M, et al. An enhanced-indicator based many-objective evolutionary algorithm with adaptive reference point. Swarm Evol Comput 2020; 55: 100669.
[http://dx.doi.org/10.1016/j.swevo.2020.100669]
[19]
Hua Y, Jin Y, Hao K. A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular Pareto fronts. IEEE Trans Cybern 2018; 49(7): 2758-70.
[PMID: 29994342] [http://dx.doi.org/10.1109/TCYB.2018.2834466]
[20]
Lin Q, Liu S, Wong KC, et al. A clustering-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 2018; 23(3): 391-405.
[http://dx.doi.org/10.1109/TEVC.2018.2866927]
[21]
Dai G, Zhou C, Wang M, et al. Indicator and reference points co-guided evolutionary algorithm for many-objective optimization problems. Knowl Base Syst 2018; 140: 50-63.
[http://dx.doi.org/10.1016/j.knosys.2017.10.025]
[22]
Liu Y, Gong D, Sun J, Jin Y. A many-objective evolutionary algorithm using a one-by-one selection strategy. IEEE Trans Cybern 2017; 47(9): 2689-702.
[http://dx.doi.org/10.1109/TCYB.2016.2638902] [PMID: 28092588]
[23]
Xiang Y, Zhou Y, Yang X, et al. A Many-objective evolutionary algorithm with Pareto-adaptive reference points. IEEE Trans Evol Comput 2019; 24(1): 99-113.
[http://dx.doi.org/10.1109/TEVC.2019.2909636]
[24]
Cheng R, Jin Y, Olhofer M, Sendhoff B. A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 2016; 20(5): 773-91.
[http://dx.doi.org/10.1109/TEVC.2016.2519378]
[25]
Tian Y, Cheng R, Zhang XY, Jin YC. PlatEMO: A MATLAB platform for evolutionary multi-objective optimization. IEEE Comput Intell Mag 2017; 12(4): 73-87.
[http://dx.doi.org/10.1109/MCI.2017.2742868]
[26]
Deb K, Thiele L, Laumanns M, Zitzler E. “Scalable test problems for evolutionary multiobjective optimization,” in evolutionary multiobjective optimization. New York, USA: Springer 2005; pp. 105-45.
[http://dx.doi.org/10.1007/1-84628-137-7_6]
[27]
Huband S, Hingston P, Barone L, While L. A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 2006; 10(5): 477-506.
[http://dx.doi.org/10.1109/TEVC.2005.861417]
[28]
Cheng R, Li M, Tian Y, et al. A benchmark test suite for evolutionary many-objective optimization. Complex & Intelligent Systems 2017; 3(1): 67-81.
[29]
Coello Coello CA, Lamont GB, Veldhuizen DAV. Evolutionary algorithms for solving multi-objective problems. 2nd ed. New York, NY: Springer Science + Business Media, LLC 2007.
[30]
Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E. Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence crite-rion IEEE Congr Evolution Comput (CEC 2006). 892-9.
[31]
Xiang Y, Zhou Y, Li M, et al. A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 2016; 21(1): 131-52.
[http://dx.doi.org/10.1109/TEVC.2016.2587808]

Rights & Permissions Print Cite
Article Metrics
11
1
© 2024 Bentham Science Publishers | Privacy Policy