| 利用遗传贪婪混合算法求解背包问题 |
| |
| 引用本文： | 张辉,郭丹.利用遗传贪婪混合算法求解背包问题[J].黑龙江工程学院学报,2010(4):43-45. |
| |
| 作者姓名： | 张辉 郭丹 |
| |
| 作者单位： | [1]黑龙江工程学院计算机科学与技术系,黑龙江哈尔滨150050 [2]哈尔滨商业大学计算机与信息工程学院,黑龙江哈尔滨150000 |
| |
| 摘 要： | 采用遗传贪婪混合算法解决背包问题,提出利用补偿算子来解决算法较早收敛于局部最优解的思想,有效抑制算法的早熟收敛。在算法的交叉操作中加入确定性策略,在算法的变异操作中加入非确定性策略,以确保算法具有更好的收敛性能。实验结果表明,该算法性能较佳,可以满足解决背包问题的需要。
|
| 关 键 词： | 背包问题 遗传算法 贪婪算法 早熟收敛 |
The solution to knapsack problem with genetic greedy algorithm |
| |
| ZHANG Hui,GUO Dan.The solution to knapsack problem with genetic greedy algorithm[J].Journal of Heilongjiang Institute of Technology,2010(4):43-45. |
| |
| Authors: | ZHANG Hui GUO Dan |
| |
| Affiliation: | 1.Department of Computer Science ＆ Technology,Heilongjiang Institute of Technology,Harbin 150050,China;2.College of Computer ＆ Information Engineering,Harbin University of Commerce,Harbin 150000,China) |
| |
| Abstract: | Knapsack problem is solved by the hybrid genetic and greedy algorithm.We proposed a method that is used to solve premature convergence with operator compensation.The method is able to overcome premature convergence of genetic algorithms.A deterministic strategy is added to the crossover operation and a non-deterministic strategy is added to the mutation operation in the algorithm so that the algorithm has better convergence performance.The experimental results show the better performance of the improved algorithm for solving knapsack problem. |
| |
| Keywords: | knapsack problem genetic algorithm greedy algorithm premature convergence |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
