背包问题
进化算法
计算机科学
数学优化
连续背包问题
数学
作者
Zhen Song,Wenjian Luo,Peilan Xu,Zipeng Ye,Kesheng Chen
出处
期刊:IFIP advances in information and communication technology
日期:2024-01-01
卷期号:: 233-246
标识
DOI:10.1007/978-3-031-57808-3_17
摘要
As a special case of the multiobjective optimization problem, the multiobjective knapsack problem (MOKP) widely exists in real-world applications. Currently, most algorithms used to solve MOKPs assume that these problems involve only one decision maker (DM). However, some complex MOKPs often involve more than one decision makers and we call such problems multiparty multiobjective knapsack problems (MPMOKPs). Existing algorithms cannot solve MPMOKPs effectively. To the best of our knowledge, there is only a little attention paid to MPMOKPs. In this paper, inspired by existing SMS-EMOA, we propose a novel indicator-based algorithm called SMS-MPEMOA to solve MPMOKPs, which aims to search solutions to satisfy all decision makers as much as possible. SMS-MPEMOA is compared with several state-of-the-art multiparty multiobjective optimization algorithms (MPMOEAs) on the benchmarks and the experimental results demonstrate that SMS-MPEMOA is very competitive.
科研通智能强力驱动
Strongly Powered by AbleSci AI