多维背包问题的启发式算法研究探讨
Heuristic Algorithms of Multidimensional Knapsack Problem
王丽娜 1陆芷1
作者信息
- 1. 上海理工大学管理学院,上海 200093
- 折叠
摘要
多维背包问题是NP难组合优化问题,其模型及算法近年来在众多领域得到了广泛应用.本文主要探讨多维背包问题的启发式求解算法,通过对相关文献进行研究,阐述现有算法的优缺点,针对多维背包问题设计更高效的启发式求解算法,为其提供新的思路和参考.
Abstract
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 multi-dimensional knapsack problems,and providing new ideas and references for them.
关键词
多维背包问题/组合优化/启发式算法Key words
multidimensional knapsack problem/combinatorial optimization/heuristic algorithms引用本文复制引用
基金项目
国家自然科学基金青年基金(72101149)
上海市浦江人才计划(22PJC080)
出版年
2024
NETL
NSTL
万方数据