计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (24): 34-36.

• 研究、探讨 • 上一篇    下一篇

求解背包问题的一种改进遗传算法

赵新超,韩 宇,艾文宝   

  1. 北京邮电大学 理学院,北京 100876
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-08-21 发布日期:2011-08-21

Improved genetic algorithm for knapsack problem

ZHAO Xinchao,HAN Yu,AI Wenbao   

  1. School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-08-21 Published:2011-08-21

摘要: 讨论了遗传算法在问题求解中的早熟现象,引进一个参数用以衡量种群中染色体的相似程度,用以增加种群的多样性;在杂交和变异运算过程中,混合了模拟退火思想作为新个体的接受准则;通常的变异算子需要扫描每一个染色体中每一个等位基因,提出一种新的变异方式,大大提高了算法搜索效率。通过实际计算比较表明,该改进遗传算法在背包问题求解中具有很好的收敛性、稳定性和计算效率。

关键词: 遗传算法, 背包问题, 模拟退火, 组合优化

Abstract: The paper discusses the premature convergence of canonical genetic algorithm.A parameter is introduced to weigh the chromosome similarity and increase the population diversity of the algorithm.The idea of simulated annealing is used to accept the new individual in the crossover and mutation operation.A new mutation operation is provided to improve the search efficiency.Experiments on knapsack problem illustrate that the new proposed genetic algorithm has better convergence,stability and efficiency.

Key words: genetic algorithm, knapsack problem, simulated annealing, combinatorial optimization