| 一种求解背包问题的混合遗传算法 |
| |
| 引用本文： | 李娟,方平.一种求解背包问题的混合遗传算法[J].南昌航空工业学院学报,1998(3):31-35. |
| |
| 作者姓名： | 李娟 方平 |
| |
| 作者单位： | 西北工业大学，南昌航空工业学院 |
| |
| 摘 要： | 将启发式贪婪算法与简单遗传法相结合构成一种混合遗传算法，用该混合遗传算法求解大规模背包问题，含有５０个物品的背包问题的试算结果表明，用这种方法求解大规模背包问题，其解的质量和求解性能较简单遗传算法和贪婪算法都有很大的改善。
|
| 关 键 词： | 遗传算法 背包问题 组合优化 混合遗传算法 |
A Hybrid Genetic Algorithm for Knapsack Problem |
| |
| Li Juan.A Hybrid Genetic Algorithm for Knapsack Problem[J].Journal of Nanchang Institute of Aeronautical Technology(Natural Science Edition),1998(3):31-35. |
| |
| Authors: | Li Juan |
| |
| Institution: | Li Juan (Northwestern Polytechnical University) Fang Ping (Nanchang Institute of Aeronautical Technology) Zhou Ming (Northwestern Polytechnical University) |
| |
| Abstract: | A hybrid genetic algorithm, which combined the simple genetic algorithm with the heuristic greedy algorithm, has been presented in this paper. This hybrid genetic algorithm has been applied to Knapsack problem. The calculating results of a Knapsack problem which consists of 50 objects, have shown that this hybrid genetic algorithm is efficient for large scale Knapsack problem. As compared with simple genetic algorithm and greedy algorithm, the quality of results and the performance of this hybrid genetic algorithm have been effectively improved. |
| |
| Keywords: | genetic algorithms Knapsack problem combinatorial optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
