Abstract
When tackling imbalanced constrained multi-objective optimization problems (CMOPs) with simultaneous convergence-hard and diversity-hard constraints, a critical issue is to balance the diversity and convergence of populations. To address this issue, this paper proposes a hybrid algorithm which combines an improved epsilon constraint-handling method (IEpsilon) with a multi-objective to multi-objective (M2M) decomposition approach, namely M2M-IEpsilon. The M2M decomposition mechanism in M2M-IEpislon has the capability to deal with imbalanced objectives. The IEpsilon constraint-handling method can prevent populations falling into large infeasible regions, thus improves the convergence performance of the proposed algorithm. To verify the performance of the proposed M2M-IEpsilon, a series of imbalanced CMOPs with simultaneous convergence-hard and diversity-hard constraints, namely ICD-CMOPs, is designed by using the DAS-CMOPs framework. Six state-of-the-art constrained multi-objective evolutionary algorithms (CMOEAs), including CM2M, CM2M2, NSGA-II-CDP, MOEA/D-CDP, MOEA/D-IEpsilon and PPS-MOEA/D, are employed to compare with M2M-IEpsilon on the ICD-CMOPs. Through the analysis of experimental results, the proposed M2M-IEpsilon is superior to the other six algorithms in solving ICD-CMOPs, which illustrates the superiority of the proposed M2M-IEpsilon in dealing with ICD-CMOPs with simultaneous convergence-hard and diversity-hard constraints.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bosman, P.A., Thierens, D.: The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans. Evol. Comput. 7(2), 174–188 (2003)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Fan, Z., et al.: An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions. Soft Comput. 23(23), 12491–12510 (2019). https://doi.org/10.1007/s00500-019-03794-x
Fan, Z., et al.: Push and pull search for solving constrained multi-objective optimization problems. Swarm Evol. Comput. 44, 665–679 (2019)
Fan, Z., et al.: Difficulty adjustable and scalable constrained multi-objective test problem toolkit. Evol. Comput. 28(3), 339–378 (2020)
Fan, Z., et al.: Analysis and multi-objective optimization of a kind of teaching manipulator. Swarm Evol. Comput. 50, 100554 (2019)
Jan, M.A., Khanum, R.A.: A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D. Appl. Soft Comput. 13(1), 128–148 (2013)
Kalyanmoy, D., et al.: Multi Objective Optimization Using Evolutionary Algorithms. John Wiley and Sons, New York (2001)
Liu, H.L., Chen, L., Deb, K., Goodman, E.D.: Investigating the effect of imbalance between convergence and diversity in evolutionary multiobjective algorithms. IEEE Trans. Evol. Comput. 21(3), 408–425 (2016)
Liu, H.L., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans. Evol. Comput. 18(3), 450–455 (2013)
Liu, H.L., Peng, C., Gu, F., Wen, J.: A constrained multi-objective evolutionary algorithm based on boundary search and archive. Int. J. Pattern Recogn. Artif. Intell. 30(01), 1659002 (2016)
Peng, C., Liu, H.L., Gu, F.: An evolutionary algorithm with directed weights for constrained multi-objective optimization. Appl. Soft Comput. 60, 613–622 (2017)
Wang, J., Zhou, Y., Wang, Y., Zhang, J., Chen, C.P., Zheng, Z.: Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms. IEEE Trans. Cybern. 46(3), 582–594 (2015)
Zhang, M., Li, H., Liu, L., Buyya, R.: An adaptive multi-objective evolutionary algorithm for constrained workflow scheduling in clouds. Distrib. Parallel Databases 36(2), 339–368 (2018)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Fan, Z. et al. (2021). An Improved Epsilon Method with M2M for Solving Imbalanced CMOPs with Simultaneous Convergence-Hard and Diversity-Hard Constraints. In: Ishibuchi, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2021. Lecture Notes in Computer Science(), vol 12654. Springer, Cham. https://doi.org/10.1007/978-3-030-72062-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-72062-9_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72061-2
Online ISBN: 978-3-030-72062-9
eBook Packages: Computer ScienceComputer Science (R0)