⑥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背包问题是比较有效的。
The method based on knowledge evolution algorithm is proposed to solve knapsack problems.
知识进化算法是在分析知识进化机制基础上提出的一种新型优化算法。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
应用推荐