摘要
多维背包问题是NP难组合优化问题,其模型及算法近年来在众多领域得到了广泛应用。本文主要探讨多维背包问题的启发式求解算法,通过对相关文献进行研究,阐述现有算法的优缺点,针对多维背包问题设计更高效的启发式求解算法,为其提供新的思路和参考。
The multidimensional knapsack problem is an NP-hard combinatorial optimization problem,Its model and algorithm has recently been widely used in many fields.This article mainly explores heuristic solving algorithms for multi-dimensional knapsack problems,by studying relevant literature,elaborating on the advantages and disadvantages of existing algorithms,designing more efficient heuristic solving algorithms for multidimensional knapsack problems,and providing new ideas and references for them.
作者
王丽娜
陆芷
WANG Li'na;LU Zhi(Business School,University of Shanghai for Science and Technology,Shanghai 200093)
出处
《软件》
2024年第2期34-36,共3页
Software
基金
国家自然科学基金青年项目“基于学习型组合算法的谱图分割问题研究”(72101149)资助
上海浦江人才计划项目“大规模社交网络中图划分变种问题建模与算法研究”(22PJC080)资助。
关键词
多维背包问题
组合优化
启发式算法
multidimensional knapsack problem
combinatorial optimization
heuristic algorithms
