Abstract
When solving complex constrained problems, how to efficiently utilize promising infeasible solutions is an essential issue because these promising infeasible solutions can significantly improve the diversity of algorithms. However, most existing constrained multi-objective evolutionary algorithms (CMOEAs) do not fully exploit these promising infeasible solutions. In order to solve this problem, a constrained multi-objective optimization evolutionary algorithm based on the dynamic constraint boundary method is proposed (CDCBM). The proposed algorithm continuously searches for promising infeasible solutions between UPF (the unconstrained Pareto front) and CPF (the constrained Pareto front) during the evolution process by the dynamically changing auxiliary population of the constraint boundary, which continuously provides supplementary evolutionary directions to the main population and improves the convergence and diversity of the main population. Extensive experiments on three well-known test suites and three real-world constrained multi-objective optimization problems demonstrate that CDCBM is more competitive than seven state-of-the-art CMOEAs.
Funder
the National Natural Science Foundation of China
the Natural Science Foundation of Hunan Province
Doctoral research start-up project
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference32 articles.
1. Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons.
2. A hybrid multiobjective memetic algorithm for multiobjective periodic vehicle routing problem with time windows;Wang;IEEE Trans. Syst. Man. Cybern. Syst.,2020
3. Tanabe, R., and Oyama, A. (2017, January 5–8). A note on constrained multi-objective optimization benchmark problems. Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain.
4. Evolutionary constrained multiobjective optimization: Test suite construction and performance comparisons;Ma;IEEE Trans. Evol. Comput.,2019
5. Tian, Y., Zhang, Y., Su, Y., Zhang, X., Tan, K.C., and Jin, Y. (2021). Balancing objective optimization and constraint satisfaction in constrained evolutionary multiobjective optimization. IEEE Trans. Cybern.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献