多选择背包问题是典型的NP难题,建立了多选择背包问题的数学模型,设计了一种粒子群优化算法对其进行求解.通过对其它文献中实例的仿真试验和结果对比,表明了算法对求解多选择背包问题的可行性和有效性.%Multi-choice knapsack problem is a typical NP difficulty. The mathematical model of multi-choice knapsack problem is established, and a particle swarm optimization algorithm is designed to solve them. Through the comparison of simulation experiments and results of examples in other literature, it showed that the feasibility and effectiveness of this method for solving the multi-choice knapsack problem.
展开▼
