摘要
采用遗传贪婪混合算法解决背包问题,提出利用补偿算子来解决算法较早收敛于局部最优解的思想,有效抑制算法的早熟收敛。在算法的交叉操作中加入确定性策略,在算法的变异操作中加入非确定性策略,以确保算法具有更好的收敛性能。实验结果表明,该算法性能较佳,可以满足解决背包问题的需要。
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.
出处
《黑龙江工程学院学报》
CAS
2010年第4期43-45,共3页
Journal of Heilongjiang Institute of Technology
关键词
背包问题
遗传算法
贪婪算法
早熟收敛
knapsack problem
genetic algorithm
greedy algorithm
premature convergence
作者简介
作者简介：张辉（1978-），女，讲师，研究方向：计算机应用．
