求解多维度背包问题的一种组合排序遗传算法

摘要

The paper presents a new order for the muhidimensional knapsack problem. Using this new order, we design an improved genetic algorithm. Computational results show that the new genetic algorithm is capable of obtaining high-quality solutions for MKP. Computational results also show that this algorithm gives superior quality solutions than Chu＇s.%提出了一种组合排序方案，并将这种排序方案应用于遗传算法．利用该排序下的遗传算法针对OR数据库中的多维度背包问题进行了求解，同时和其它类似算法进行了实验比较．