.png){kind=icon}
返回
Solving binary multi-objective knapsack problems with novel greedy strategy
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-021-00344-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper shows that the many greedy strategies that have been designed to repair infeasible solutions to multi-objective knapsack problems (MOKPs) with small item differences perform poorly when item differences are large. To effectively solve different types of MOKPs, this paper proposes a greedy strategy to improve the quality of feasible and infeasible solutions. It repairs all of the infeasible solutions to feasible solutions, and then maximizes the quality of each feasible solution under the limitations of knapsack capacities. Simulation experiments on different types of MOKPs show that the proposed strategy is superior to existing strategies. Compared with MOGLS, MOEA/D, and MOEA/D-M2M, the proposed evolutionary framework performs better in solving different MOKPs.
Keyword:
Knapsack problems
Greedy strategy
Multi-objective optimization
Evolutionary algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
453
被引数:
718
机构
引用论文
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
OAAI分享收藏Alleviative effects of different kinds of exogenous polyamines on salt inj ury of Soybean seedlings.png)
IF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容