%0 Journal Article
%T Genetic algorithm with schema replaced for solving 0/1 knapsack problem<br>一种基于模式替代的遗传算法解0/1背包问题
%A LI Kang-shun
%A JIA Yu-zhen
%A ZHANG Wen-sheng
%A <br>李康顺
%A 贾玉珍
%A 张文生
%J 计算机应用研究
%D 2009
%I 
%X Knapsack problem is a typical NP complete problem.This paper raised genetic algorithm with schema replaced for solving 0/1 knapsack problem.It leaded the search direction of the population to a schema by collecting the best several individuals in population.So,improved the searching efficiency and ability.At last,gave the simulation experiment,and the answer of the knapsack problem which was solved by simple genetic algorithm,compared greedy algorithm and genetic algorithm with schema replaced.By this compa...
%K knapsack problem(KP)
%K schema replaced
%K genetic algorithm<br>背包问题
%K 模式替代
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=65D27D3C8444850D66C9D1B766B9199E&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=0B39A22176CE99FB&sid=47F7649551A37CFC&eid=DCE57F652E4ADAFC&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=2&reference_num=7