Adaptive constraint handling technique selection for constrained multi-objective optimization

计算机科学 数学优化 选择(遗传算法) 约束(计算机辅助设计) 人口 进化算法 强化学习 过程(计算) 最优化问题 人工智能 国家(计算机科学) 代表(政治) 算法 数学 几何学 人口学 社会学 政治 政治学 法学 操作系统
作者
Chao Wang,Zhihao Liu,Jianfeng Qiu,Lei Zhang
出处
期刊:Swarm and evolutionary computation [Elsevier]
卷期号:86: 101488-101488 被引量:1
标识
DOI:10.1016/j.swevo.2024.101488
摘要

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 ϵ-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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
打铁佬完成签到,获得积分10
1秒前
孝艺完成签到 ,获得积分10
2秒前
小王完成签到,获得积分10
2秒前
桐桐应助年轻的冰凡采纳,获得10
2秒前
大个应助Carol采纳,获得10
3秒前
影像大侠完成签到,获得积分10
3秒前
舒心乐荷发布了新的文献求助30
4秒前
朴素爆米花完成签到,获得积分10
4秒前
科研小菜狗完成签到 ,获得积分10
5秒前
王运静完成签到,获得积分10
5秒前
6秒前
花椒完成签到,获得积分10
6秒前
福明明完成签到,获得积分10
6秒前
平常的可乐完成签到 ,获得积分10
6秒前
白鹿关注了科研通微信公众号
7秒前
深山何处钟声鸣完成签到 ,获得积分10
9秒前
9秒前
10秒前
Sunny完成签到,获得积分10
10秒前
10秒前
Ivy发布了新的文献求助10
11秒前
低头啃草牛完成签到,获得积分10
11秒前
12秒前
普普发布了新的文献求助10
12秒前
Leexxxhaoo完成签到,获得积分10
12秒前
文献文献文献完成签到,获得积分0
13秒前
ES完成签到 ,获得积分10
13秒前
危机的芸完成签到,获得积分10
13秒前
13秒前
大胆短靴完成签到,获得积分10
14秒前
Da完成签到,获得积分10
14秒前
中旬日完成签到 ,获得积分10
15秒前
丘比特应助年轻的冰凡采纳,获得10
15秒前
yangjoy完成签到 ,获得积分10
15秒前
曾欢完成签到,获得积分10
16秒前
leeOOO完成签到,获得积分10
16秒前
SciGPT应助维嘉采纳,获得10
16秒前
bao完成签到,获得积分10
17秒前
YZH发布了新的文献求助10
18秒前
老木虫发布了新的文献求助10
18秒前
高分求助中
请在求助之前详细阅读求助说明!!!! 20000
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
The Three Stars Each: The Astrolabes and Related Texts 900
Yuwu Song, Biographical Dictionary of the People's Republic of China 800
Multifunctional Agriculture, A New Paradigm for European Agriculture and Rural Development 600
Bernd Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
A radiographic standard of reference for the growing knee 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2478892
求助须知:如何正确求助?哪些是违规求助? 2141545
关于积分的说明 5459360
捐赠科研通 1864725
什么是DOI,文献DOI怎么找? 926979
版权声明 562915
科研通“疑难数据库(出版商)”最低求助积分说明 496023