Journal
IEEE TRANSACTIONS ON CYBERNETICS
Volume 52, Issue 10, Pages 10163-10176Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2021.3056176
Keywords
Statistics; Sociology; Optimization; Linear programming; Sorting; Search problems; Transforms; Angle-based selection; bidirectional coevolution; constrained multiobjective optimization problems (CMOPs); constraint-handling technique (CHT); evolutionary algorithms
Categories
Funding
- Science and Technology Commission of Shanghai Municipality [19511120600]
- Program for Guangdong Introducing Innovative and Enterpreneurial Teams [2017ZT07X386]
- Shenzhen Peacock Plan [KQTD2016112514355531]
- National Leading Youth Talent Support Program of China
Ask authors/readers for more resources
This article presents a novel constrained multiobjective optimization algorithm BiCo, which maintains two populations and evolves from the feasible and infeasible regions towards the PF successfully.
Constrained multiobjective optimization problems (CMOPs) involve both conflicting objective functions and various constraints. Due to the presence of constraints, CMOPs' Pareto-optimal solutions are very likely lying on constraint boundaries. The experience from the constrained single-objective optimization has shown that to quickly obtain such an optimal solution, the search should surround the boundary of the feasible region from both the feasible and infeasible sides. In this article, we extend this idea to cope with CMOPs and, accordingly, we propose a novel constrained multiobjective evolutionary algorithm with bidirectional coevolution, called BiCo. BiCo maintains two populations, that is: 1) the main population and 2) the archive population. To update the main population, the constraint-domination principle is equipped with an NSGA-II variant to move the population into the feasible region and then to guide the population toward the Pareto front (PF) from the feasible side of the search space. While for updating the archive population, a nondominated sorting procedure and an angle-based selection scheme are conducted in sequence to drive the population toward the PF within the infeasible region while maintaining good diversity. As a result, BiCo can get close to the PF from two complementary directions. In addition, to coordinate the interaction between the main and archive populations, in BiCo, a restricted mating selection mechanism is developed to choose appropriate mating parents. Comprehensive experiments have been conducted on three sets of CMOP benchmark functions and six real-world CMOPs. The experimental results suggest that BiCo can obtain quite competitive performance in comparison to eight state-of-the-art-constrained multiobjective evolutionary optimizers.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available