Abstract
Since different reference points are crucial for calculating convergence, we design a many-objective evolutionary algorithm with an adaptive convergence calculation method (ACC-MaOEA). This algorithm uses the adaptive convergence calculation method to estimate the shape of the Pareto front (PF) and adaptively determines a reference point to calculate convergence based on the shape. It estimates the PF shape by comparing the distances from the ideal and key points to two parallel planes. If the PF is concave, the ideal point is used as the reference point, and the distance from the solution to a plane through the ideal point is calculated to approximate convergence; if the PF is convex, the nadir point is used as the reference point, and the distance from the solution to a plane through the nadir point is calculated to approximate convergence. To avoid the overestimation of the nadir point, we first adopt a ratio-based infinite norm indicator to determine a potential region in which the optimal solution exists and then estimate the PF shape in this region and adaptively calculate convergence. Additionally, we use a determinantal point process to sample solutions with good convergence and diversity. We compare ACC-MaOEA with state-of-the-art algorithms on 21 test problems and up to 15 objectives. The experimental results show that ACC-MaOEA significantly outperforms its competitors, especially on regular PF problems.
Similar content being viewed by others
References
Tostado-Véliz M, Kamel S, Aymen F, Jurado F (2022) A novel hybrid lexicographic-igdt methodology for robust multi-objective solution of home energy management systems. Energy 253:124146. https://doi.org/10.1016/j.energy.2022.124146
Zhang M, Wang L, Li W, Hu B, Li D, Wu Q (2021) Many-objective evolutionary algorithm with adaptive reference vector. Inf Sci 563:70–90. https://doi.org/10.1016/j.ins.2021.01.015
**ang Y, Zhou Y, Li M, Chen Z (2016) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 21(1):131–152. https://doi.org/10.1109/TEVC.2016.2587808
Farias de LRC, Araújo AFR (2022) A decomposition-based many-objective evolutionary algorithm updating weights when required. Swarm Evol Comput 68:100980 . https://doi.org/10.1016/j.swevo.2021.100980
**ang Y, Zhou Y, Yang X, Huang H (2019) A many-objective evolutionary algorithm with Pareto-adaptive reference points. IEEE Trans Evol Comput 24(1):99–113. https://doi.org/10.1109/TEVC.2019.2909636
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197. https://doi.org/10.1109/4235.996017
Zhao C, Zhou Y, Chen Z (2021) Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem. Inf Sci 546:1030–1046. https://doi.org/10.1016/j.ins.2020.08.084
Yang F, Xu L, Chu X, Wang S (2021) A new dominance relation based on convergence indicators and niching for many-objective optimization. Appl Intell 51 (8):5525–5542. https://doi.org/10.1007/s10489-020-01976-x
Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601. https://doi.org/10.1109/TEVC.2013.2281535
Sun Y, Xue B, Zhang M, Yen GG (2019) A new two-stage evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 23(5):748–761. https://doi.org/10.1109/TEVC.2018.2882166
Li G, Wang G-G, Dong J, Yeh W-C, Li K (2021) Dlea: a dynamic learning evolution algorithm for many-objective optimization. Inf Sci 574:567–589. https://doi.org/10.1016/j.ins.2021.05.064
Shen J, Wang P, Dong H, Li J, Wang W (2022) A multistage evolutionary algorithm for many-objective optimization. Inf Sci 589:531–549. https://doi.org/10.1016/j.ins.2021.12.096
Zhou J, Zou J, Yang S, Zheng J, Gong D, Pei T (2021) Niche-based and angle-based selection strategies for many-objective evolutionary optimization. Inf Sci 571:133–153. https://doi.org/10.1016/j.ins.2021,04.050
Zhou J, Rao S, Gao L, Lu C, Zheng J, Chan FTS (2022) Self-regulated bi-partitioning evolution for many-objective optimization. Inf Sci 589:827–848. https://doi.org/10.1016/j.ins.2021.12.103
Bader J, Zitzler E (2011) Hype: An algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45–76. https://doi.org/10.1162/EVCO_a_00009
Shang K, Ishibuchi H (2020) A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 24(5):839–852. https://doi.org/10.1109/TEVC.2020.2964705
Wang H, Jiao L, Yao X (2015) Two-Arch2: An improved Two-Archive algorithm for many-objective optimization. IEEE Trans Evol Comput 19(4):524–541. https://doi.org/10.1109/TEVC.2014.2350987
Liu Y, Zhu N, Li K, Li M, Zheng J, Li K (2020) An angle dominance criterion for evolutionary many-objective optimization. Inf Sci 509:376–399. https://doi.org/10.1016/j.ins.2018.12.078
Tian Y, Cheng R, Zhang X, Su Y, ** Y (2019) A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization. IEEE Trans Evol Comput 23 (2):331–345. https://doi.org/10.1109/TEVC.2018.2866854
Zhou J, Yao X, Gao L, Hu C (2021) An indicator and adaptive region division based evolutionary algorithm for many-objective optimization. Appl Soft Comput 99:106872. https://doi.org/10.1016/j.asoc.2020.106872
Liu S, Lin Q, Wong K-C, Coello Coello CA, Li J, Ming Z, Zhang J (2022) A self-guided reference vector strategy for many-objective optimization. IEEE Transactions on Cybernetics 52(2):1164–1178. https://doi.org/10.1109/TCYB.2020.2971638
Sun Y, **ao K, Wang S, Lv Q (2021) An evolutionary many-objective algorithm based on decomposition and hierarchical clustering selection, Appl Intell, pp 1–46. https://doi.org/10.1007/s10489-021-02669-9
Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257–271. https://doi.org/10.1109/4235.797969
Zitzler E, Thiele L, Laumanns M, Fonseca CM, Fonseca da VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117–132. https://doi.org/10.1109/TEVC.2003.810758
Liang Z, Luo T, Hu K, Ma X, Zhu Z (2021) An indicator-based many-objective evolutionary algorithm with boundary protection. IEEE Transactions on Cybernetics 51(9):4553–4566. https://doi.org/10.1109/TCYB.2019.2960302
Zhang P, Li J, Li T, Chen H (2021) A new many-objective evolutionary algorithm based on determinantal point processes. IEEE Trans Evol Comput 25(2):334–345. https://doi.org/10.1109/TEVC.2020.3035825
Wang Z, Zhang Q, Li H, Ishibuchi H, Jiao L (2017) On the use of two reference points in decomposition based multiobjective evolutionary algorithms. Swarm Evol Comput 34:89–102. https://doi.org/10.1016/j.swevo.2017.01002
**ong Z, Yang J, Hu Z, Zhao Z, Wang X (2021) Evolutionary many-objective optimization algorithm based on angle and clustering. Appl Intell 51(4):2045–2062. https://doi.org/10.1007/s10489-020-01874-2
Deb K, Miettinen K, Chaudhuri S (2010) Toward an estimation of nadir objective vector using a hybrid of evolutionary and local search approaches. IEEE Trans Evol Comput 14(6):821–841. https://doi.org/10.1109/TEVC.2010.2041667
**ang Y, Zhou Y, Yang X, Huang H (2020) A many-objective evolutionary algorithm with pareto-adaptive reference points. IEEE Trans Evol Comput 24(1):99–113. https://doi.org/10.1109/TEVC.2019.2909636
Qi Y, Yu J, Li X, Quan Y, Miao Q (2018) Enhancing robustness of the inverted PBI scalarizing method in MOEA/d. Appl Soft Comput 71:1117–1132. https://doi.org/10.1016/j.asoc.2017.11029,
Li L, Yen GG, Sahoo A, Chang L, Gu T (2021) On the estimation of pareto front and dimensional similarity in many-objective evolutionary algorithm. Inf Sci 563:375–400. https://doi.org/10.1016/j.ins.2021.03008
Liu Y, Gong D, Sun J, ** Y (2017) A many-objective evolutionary algorithm using a one-by-one selection strategy. IEEE Transactions on Cybernetics 47(9):2689–2702. https://doi.org/10.1109/TCYB.2016.2638902
Pan L, He C, Tian Y, Su Y, Zhang X (2017) A region division based diversity maintaining approach for many-objective optimization. Integrated Computer-Aided Engineering 24(3):279–296. https://doi.org/10.3233/ICA-170542
Wang R, Zhang Q, Zhang T (2016) Decomposition-based algorithms using pareto adaptive scalarizing methods. EEE Trans Evol Comput 20(6):821–837. https://doi.org/10.1109/TEVC.2016.2521175
Yuan J, Liu H-L, Gu F, Zhang Q, He Z (2021) Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions. IEEE Trans Evol Comput 25(1):75–86. https://doi.org/10.1109/TEVC.2020.2999100
Chen L, Zhang G, Zhou H (2018) Fast greedy MAP inference for determinantal point process to improve recommendation diversity. In: NIPS’18, pp 5627–5638. https://doi.org/10.5555/3327345.3327465
Zhang C, Liu J, Wang G, Li G (2021) DPP-VSE: Constructing a variable selection ensemble by determinantal point processes. Expert Syst Appl 178:115025. https://doi.org/10.1016/j.eswa.2021.115025
Yue X, **ao X, Chen Y, Qian J (2020) Robust neighborhood covering reduction with determinantal point process sampling. Knowl-Based Syst 188:105063. https://doi.org/10.1016/j.knosys.2019.105063
Sun Y, Yen GG, Yi Z (2018) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173–187. https://doi.org/10.1109/TEVC.2018.2791283
Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary Multiobjective Optimization, pp. 105–145. https://doi.org/10.1007/1-84628-137-7_6
Cheng R, Li M, Tian Y, Zhang X, Yang S, ** Y, Yao X (2017) A benchmark test suite for evolutionary many-objective optimization. Complex & Intelligent Systems 3:67–81. https://doi.org/10.1007/s40747-017-0039-7
Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477–506. https://doi.org/10.1109/TEVC.2005.861417
Tian Y, Cheng R, Zhang X, ** Y (2017) PlatEMO: A matlab platform for evolutionary multi-objective optimization. IEEE Comput Intell Mag 12(4):73–87. https://doi.org/10.1109/MCI.2017.2742868
Zhu Q, Lin Q, Li J, Coello Coello CA, Ming Z, Chen J, Zhang J (2021) An elite gene guided reproduction operator for many-objective optimization. IEEE Transactions on Cybernetics 51 (2):765–778. https://doi.org/10.1109/TCYB.2019.2932451
Acknowledgements
This research is supported by the Natural Science Foundation of Anhui Province, China (Grant No. 1808085MF174, 1808085QF181), the National Natural Science foundation of China (Grant No. 61976101), the Key projects of Natural Science Foundation of Anhui Provincial Department of Education (KJ2019A0603), the Key Research & Development Project of Anhui Province (Grant No. 201904a05020072), the Natural Science Research Project of Anhui Province (Graduate Research Project, Grant No. YJS20210463), the funding plan for scientic research activities of academic and technicalleaders and reserve candidates in Anhui Province (Grant No. 2021H264), the top talent project of disciplines (majors) in Colleges and universities in Anhui Province (Grant No. gxbjZD2022021) and supported by the Graduate Innovation Fund of Huaibei Normal University (Grant No. cx2022041). We thank the language expert of Springer for editing in English.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
This manuscript has not been published or presented elsewhere and is not under consideration by another journal. We have read and understood your journal’s policies, and we believe that neither the manuscript nor the study violates any of these, and all authors have checked the manuscript and have agreed to the submission. There are no conflicts of interest to declare.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wang, M., Ge, F., Chen, D. et al. A many-objective evolutionary algorithm with adaptive convergence calculation. Appl Intell 53, 17260–17291 (2023). https://doi.org/10.1007/s10489-022-04296-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-022-04296-4