%0 Journal Article
%T Novel chaos genetic algorithm for solving 0-1 knapsack problem<br>求解0-1背包问题的混沌遗传算法
%A TIAN Jian-li
%A CHAO Xue-peng
%A <br>田建立
%A 晁学鹏
%J 计算机应用研究
%D 2011
%I 
%X This paper proposed a novel chaos genetic algorithm for solving the 0-1 knapsack problem. Enhanced the ergodicity of chaotic search by using power function carrier technology, improved genetic algorithm premature problem by embeding chaos optimal solution obtained into basic GA, and improved the capacity of algorithm to avoid the local extreme and to converge to the global optimal solution quickly. Results of the numerical experiment show that the proposed algorithm is effective and useful in solving 0-1 knapsack problem.
%K chaos genetic algorithm
%K power function carrier technology
%K knapsack problems(KP)
%K optimization algorithm<br>混沌遗传算法
%K 幂函数载波技术
%K 背包问题
%K 优化算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F32C7DEF351C88CC8F2176D815E5740A&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=5D311CA918CA9A03&sid=8B96FBF5BCE341D5&eid=70B3E1F819C80B0A&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=6