%0 Journal Article
%T Mixed-coding-based differential evolution algorithm for 0-1 knapsack problem<br>基于混合编码的差异演化算法解0-1背包问题
%A DENG Chang-shou
%A ZHAO Bing-yan
%A LIANG Chang-yong
%A <br>邓长寿
%A 赵秉岩
%A 梁昌勇
%J 计算机应用研究
%D 2010
%I 
%X This paper proposed mixed-coding-based differential evolution algorithm for 0-1 knapsack problem which was NP complete. This algorithm was based on the original differential evolution using mix-coding mechanism in which each decision variable was represented by the combination of one float number and a binary number. Firstly, proposed a new mapping operator to construct mixed-coding population, and then defined a new operator which dealt with the boundary constraint. Lastly used a discarding operator to adapt the infeasible solution. Simulation numerical results compared with that of genetic algorithm and binary differential evolution show that this algorithm is efficient and practical for 0-1 knapsack problem.
%K 0-1 knapsack problem
%K mix coding
%K differential evolution
%K discarding operator<br>0-1背包问题
%K 混合编码
%K 差异演化算法
%K 丢弃算子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=8A66A40556FD20748483B7430FA645E3&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=B31275AF3241DB2D&sid=DB7C57A2F6AB0CB0&eid=CAE000D2C4E36F22&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=10