⑥A new discrete PSO model (SDPSO) for set-based combinatorial optimization problems is constructed and a set-based method for knapsack problems based on this model is designed.
⑥建立了一种新的解决集合组合优化问题的离散粒子群优化模型(SDPSO),并由此设计出背包问题的集合解决方法。
参考来源 - 粒子群优化的邻居拓扑结构和算法改进研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems.
因此，应用该混合智能算法求解0 - 1背包问题是比较有效的。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
The numerical experimental results show that NSGA-II with the neighborhood search can outperform NSGA-II applied to multi-objective 0-1 knapsack problems.
数值实验表明，引入邻域搜索机制的NSGA - II算法在求解多目标0 - 1背包问题时表现出更好的性能。
应用推荐