计算机工程与应用2011，Vol.47Issue(24)：34-36,45,4.DOI:10.3778/j.issn.1002-8331.2011.24.010
求解背包问题的一种改进遗传算法
Improved genetic algorithm for knapsack problem
摘要
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分类
信息技术与安全科学引用本文复制引用
赵新超,韩宇,艾文宝..求解背包问题的一种改进遗传算法[J].计算机工程与应用,2011,47(24):34-36,45,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.10971017) （the National Natural Science Foundation of China under Grant No.10971017）
中央高校基本科研业务费专项资金(No.BUPT2009RC0701). （No.BUPT2009RC0701）
