计算机工程与应用2011，Vol.47Issue(34)：44-46,63,4.DOI:10.3778/j.issn.1002-8331.2011.34.011
一种求解0-1背包问题的改进遗传算法
Improved genetic algorithm to 0-1 knapsack problem
吕晓峰 1张勇亮 2马羚2
作者信息
- 1. 海军航空工程学院兵器科学与技术系,山东烟台264001
- 2. 海军航空工程学院研究生管理大队,山东烟台264001
- 折叠
摘要
Abstract
An improved Genetic Algorithm(GA) is proposed to solve 0-1 Knapsack Problem(KP) considering the deficiency of the Simple GA(SGA) that being easy to "precocity".A new way to decode is designed to ensure solutions workable according to the way of dual-structure coding, and to revise individuals without corresponding solutions in the population at the same time.And SGA is improved by the Simulated Annealing (SA) algorithm and improved elite selection operator.The advantage of the improved GA in the evolution efficiency and the ability to search the best solution is proved by the simulation results.关键词
遗传算法/背包问题/解码/模拟退火/精英选择Key words
Genetic Algorithm(GA)/ Knapsack Problem (KP)/ decode way/ Simulated Annealing(SA)/ elite selection分类
信息技术与安全科学引用本文复制引用
吕晓峰,张勇亮,马羚..一种求解0-1背包问题的改进遗传算法[J].计算机工程与应用,2011,47(34):44-46,63,4.
