A review of Pareto pruning methods for multi-objective optimization

帕累托原理 修剪 多目标优化 计算机科学 数学优化 数学 生物 植物
作者
Sanyapong Petchrompo,David W. Coit,Alexandra Brintrup,Anupong Wannakrairot,Ajith Kumar Parlikad
出处
期刊:Computers & Industrial Engineering [Elsevier]
卷期号:167: 108022-108022 被引量:161
标识
DOI:10.1016/j.cie.2022.108022
摘要

• Novel classification of multi-objective optimization methods. • Subclassifcation of Pareto pruning methods according to the pruning instruction. • A review of performance indicators for the pruned Pareto set. • Comparative analyses across different multi-objective optimization classes. • Insights into current trends and potential research areas for Pareto pruning methods. Previous researchers have made impressive strides in developing algorithms and solution methodologies to address multi-objective optimization (MOO) problems in industrial engineering and associated fields. One traditional approach is to determine a Pareto optimal set that represents the trade-off between objectives. However, this approach could result in an extremely large set of solutions, making it difficult for the decision maker to identify the most promising solutions from the Pareto front. To deal with this issue, later contributors proposed alternative approaches that can autonomously draw up a shortlist of Pareto optimal solutions so that the results are more comprehensible to the decision maker. These alternative approaches are referred to as the pruning method in this review. The selection of the representative solutions in the pruning method is based on a predefined instruction, and its resolution process is mostly independent of the decision maker. To systematize studies on this aspect, we first provide the definitions of the pruning method and related terms; then, we establish a new classification of MOO methods to distinguish the pruning method from the a priori , a posteriori , and interactive methods. To facilitate readers in identifying a method that suits their interests, we further classify the pruning method by the instruction on how the representative solutions are selected, namely into the preference-based, diversity-based, efficiency-based, and problem specific methods. Ultimately, the comparative analysis of the pruning method and other MOO approaches allows us to provide insights into the current trends in the field and offer recommendations on potential research directions.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
石翎完成签到,获得积分10
刚刚
Jasen发布了新的文献求助20
刚刚
wy0409发布了新的文献求助10
1秒前
HOPE发布了新的文献求助20
1秒前
1秒前
1秒前
Willy发布了新的文献求助10
1秒前
江河日山完成签到,获得积分10
1秒前
哈哈哈完成签到,获得积分10
2秒前
Ha放狗小Pi完成签到,获得积分10
2秒前
2秒前
3秒前
3秒前
小白发布了新的文献求助10
3秒前
知性的成完成签到 ,获得积分10
3秒前
易海之旅完成签到,获得积分10
3秒前
鱼鱼鱼完成签到,获得积分10
3秒前
Kiki发布了新的文献求助10
4秒前
文艺的如娆完成签到,获得积分10
4秒前
魔幻曼雁完成签到,获得积分10
4秒前
4秒前
可靠采波完成签到,获得积分10
4秒前
顺利蜻蜓发布了新的文献求助10
5秒前
Xu完成签到,获得积分10
5秒前
大模型应助孝顺的冬卉采纳,获得10
5秒前
梁亚龙完成签到,获得积分10
5秒前
好奇的书蛋完成签到,获得积分10
5秒前
协和_子鱼完成签到,获得积分10
6秒前
情怀应助不羁的风采纳,获得10
6秒前
ding应助JHL采纳,获得10
6秒前
小黑驴完成签到 ,获得积分10
6秒前
小鹿呀完成签到,获得积分10
6秒前
6秒前
6秒前
打打应助zark采纳,获得10
6秒前
6秒前
路边野餐完成签到 ,获得积分10
6秒前
6秒前
任性完成签到,获得积分10
7秒前
7秒前
高分求助中
Modern Epidemiology, Fourth Edition 5000
Kinesiophobia : a new view of chronic pain behavior 5000
Molecular Biology of Cancer: Mechanisms, Targets, and Therapeutics 3000
Digital Twins of Advanced Materials Processing 2000
Propeller Design 2000
Weaponeering, Fourth Edition – Two Volume SET 2000
First commercial application of ELCRES™ HTV150A film in Nichicon capacitors for AC-DC inverters: SABIC at PCIM Europe 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 化学工程 生物化学 物理 计算机科学 内科学 复合材料 催化作用 物理化学 光电子学 电极 冶金 细胞生物学 基因
热门帖子
关注 科研通微信公众号,转发送积分 6005909
求助须知:如何正确求助?哪些是违规求助? 7531142
关于积分的说明 16116104
捐赠科研通 5151639
什么是DOI,文献DOI怎么找? 2760077
邀请新用户注册赠送积分活动 1737334
关于科研通互助平台的介绍 1632307