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 被引量:42
标识
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
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
哈哈哈嗝发布了新的文献求助10
1秒前
2秒前
通天塔发布了新的文献求助10
2秒前
lalala发布了新的文献求助10
5秒前
5秒前
Dawn完成签到,获得积分10
6秒前
lyyt发布了新的文献求助10
8秒前
Moonkiss发布了新的文献求助10
8秒前
Henry浩发布了新的文献求助10
10秒前
13秒前
或许度发布了新的文献求助10
13秒前
王贤平完成签到,获得积分10
15秒前
16秒前
gc发布了新的文献求助10
18秒前
lalala发布了新的文献求助10
19秒前
星辰大海应助通天塔采纳,获得10
19秒前
20秒前
帅帅哈完成签到 ,获得积分10
23秒前
天天快乐应助欣喜寒安采纳,获得10
23秒前
FashionBoy应助小虫采纳,获得10
24秒前
寻道图强应助缓慢的荧采纳,获得20
27秒前
30秒前
顾矜应助喵喵采纳,获得10
34秒前
Ava应助YH采纳,获得10
35秒前
随风完成签到,获得积分10
35秒前
江南发布了新的文献求助30
35秒前
罗杰完成签到 ,获得积分10
41秒前
祈雨完成签到,获得积分10
45秒前
lanzai完成签到 ,获得积分10
45秒前
小马日常挨打完成签到 ,获得积分10
46秒前
48秒前
完美世界应助gc采纳,获得10
48秒前
50秒前
乒哩乓拉发布了新的文献求助10
51秒前
1107任务报告完成签到 ,获得积分10
52秒前
遇123发布了新的文献求助10
52秒前
air-yi完成签到,获得积分10
54秒前
木槿花难开完成签到,获得积分10
55秒前
一五完成签到,获得积分10
56秒前
56秒前
高分求助中
Manual of Clinical Microbiology, 4 Volume Set (ASM Books) 13th Edition 1000
Teaching Social and Emotional Learning in Physical Education 900
Boris Pesce - Gli impiegati della Fiat dal 1955 al 1999 un percorso nella memoria 500
Chinese-English Translation Lexicon Version 3.0 500
Recherches Ethnographiques sue les Yao dans la Chine du Sud 500
Two-sample Mendelian randomization analysis reveals causal relationships between blood lipids and venous thromboembolism 500
[Lambert-Eaton syndrome without calcium channel autoantibodies] 460
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2397121
求助须知:如何正确求助?哪些是违规求助? 2099007
关于积分的说明 5290650
捐赠科研通 1826671
什么是DOI,文献DOI怎么找? 910582
版权声明 560023
科研通“疑难数据库(出版商)”最低求助积分说明 486752