多选择背包问题是典型的NP难题.建立了多选择背包问题的数学模型.设计了差异演化算法对其进行求解.通过对其它文献中实例的仿真试验和结果对比,表明了算法求解多选择背包问题的可行性和有效性.%Multiple-choice knapsack problem is a typical NP problem. The model of multiple-choice knapsack problem was formulated and differential evolution was designed to solve it. Example in other references is recomputed and both simulation results are compared. It can be found that the possibility and the efficiency of the algorithm in solving multiple-choice knapsack problem.
展开▼
