Adaptive constraint handling technique selection for constrained multi-objective optimization

被引:15
作者
Wang, Chao [1 ,2 ]
Liu, Zhihao [2 ]
Qiu, Jianfeng [2 ]
Zhang, Lei [3 ,4 ]
机构
[1] Anhui Univ, Informat Mat & Intelligent Sensing Lab Anhui Prov, Hefei 230601, Peoples R China
[2] Anhui Univ, Engn Res Ctr Autonomous Unmanned Syst Technol, Sch Artificial Intelligence, Minist Educ, Hefei 230601, Peoples R China
[3] China Three Gorges Univ, Coll Comp & Informat Technol, Yichang 443002, Peoples R China
[4] Hubei Univ Automot Technol, Inst Vehicle Informat Control & Network Technol, Shiyan 442002, Peoples R China
基金
中国国家自然科学基金;
关键词
Constrained multiobjective optimization; Evolutionary algorithm; Constraint handling technique; Operator; Deep reinforcement learning; DIFFERENTIAL EVOLUTION ALGORITHM; FRAMEWORK; ENSEMBLE; RANKING;
D O I
10.1016/j.swevo.2024.101488
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Constrained multi-objective optimization problems involve the optimization of multiple conflicting objectives simultaneously subject to a number of constraints, which pose a great challenge for the existing algorithms. When utilizing evolutionary algorithms to solve them, the constraint handling technique (CHT) plays a pivotal role in the environmental selection. Several CHTs, such as penalty functions, superiority of feasible solutions, and epsilon-constraint methods, have been developed. However, there are still some issues with the existing methods. On the one hand, different CHTs are typically better suited to specific problem and selecting the most appropriate CHT for a given problem is crucial. On the other hand, the suitability of CHTs may vary throughout different stages of the optimization process. Regrettably, limited attention has been given to the adaptive selection of CHTs. In order to address this research gap, we develop an adaptive CHT selection method based on deep reinforcement learning, allowing for the selection of CHTs that are tailored to different evolutionary states. In the proposed method, we adopt the deep Q-learning network to evaluate the impact of various CHTs and operators on the population state during evolution. Through a dynamic evaluation, the network adaptively outputs the most appropriate CHT and operator portfolio based on the current state of the population. Specifically, we propose novel state representation and reward calculation methods to accurately capture the performance of diverse actions across varying evolutionary states. Furthermore, to enhance network training, we introduce a two-stage training method that facilitates the collection of diverse samples. Moreover, this adaptive selection method can be easily integrated into the existing methods. The proposed algorithm is tested on 37 test problems, the optimal results can be achieved on 19 instances in terms of the inverted generational distance metric. Experimental results verify the proposed method generalizes well to different types of problems.
引用
收藏
页数:16
相关论文
共 64 条
[11]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[12]   An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Huang, Han ;
Fang, Yi ;
You, Yugen ;
Mo, Jiajie ;
Wei, Caimin ;
Goodman, Erik .
SOFT COMPUTING, 2019, 23 (23) :12491-12510
[13]   Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Li, Hui ;
Wei, Caimin ;
Zhang, Qingfu ;
Deb, Kalyanmoy ;
Goodman, Erik .
EVOLUTIONARY COMPUTATION, 2020, 28 (03) :339-378
[14]   Push and pull search for solving constrained multi-objective optimization problems [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Li, Hui ;
Wei, Caimin ;
Zhang, Qingfu ;
Deb, Kalyanmoy ;
Goodman, Erik .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 :665-679
[15]   Adaptive Ranking Mutation Operator Based Differential Evolution for Constrained Optimization [J].
Gong, Wenyin ;
Cai, Zhihua ;
Liang, Dingwen .
IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (04) :716-727
[16]   Paired Offspring Generation for Constrained Large-Scale Multiobjective Optimization [J].
He, Cheng ;
Cheng, Ran ;
Tian, Ye ;
Zhang, Xingyi ;
Tan, Kay Chen ;
Jin, Yaochu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (03) :448-462
[17]   A Multiform Optimization Framework for Constrained Multiobjective Optimization [J].
Jiao, Ruwang ;
Xue, Bing ;
Zhang, Mengjie .
IEEE TRANSACTIONS ON CYBERNETICS, 2023, 53 (08) :5165-5177
[18]   Handling Constrained Many-Objective Optimization Problems via Problem Transformation [J].
Jiao, Ruwang ;
Zeng, Sanyou ;
Li, Changhe ;
Yang, Shengxiang ;
Ong, Yew-Soon .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (10) :4834-4847
[19]   Multiobjective Evolution of Biped Robot Gaits Using Advanced Continuous Ant-Colony Optimized Recurrent Neural Networks [J].
Juang, Chia-Feng ;
Yeh, Yen-Ting .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (06) :1910-1922
[20]   A Benchmark-Suite of real-World constrained multi-objective optimization problems and some baseline results [J].
Kumar, Abhishek ;
Wu, Guohua ;
Ali, Mostafa Z. ;
Luo, Qizhang ;
Mallipeddi, Rammohan ;
Suganthan, Ponnuthurai Nagaratnam ;
Das, Swagatam .
SWARM AND EVOLUTIONARY COMPUTATION, 2021, 67