%0 Journal Article
%T An Improved Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem<br>求解多维0-1背包问题的一种改进的遗传算法
%A ZENG Zhi
%A YANG Xiao-Fan
%A CHEN Jing
%A CHEN Wen-Bin
%A TANG Rong-Wang
%A <br>曾智
%A 杨小帆
%A 陈静
%A 陈文斌
%A 唐荣旺
%J 计算机科学
%D 2006
%I 
%X This paper proposes a new crossover operator which is called median crossover. It is designed by using the ideas of the greedy algorithm and the 2- division search algorithm, and aims at the multidimensional 0-1 knapsack problem. Based on this median crossover operator, the paper also presents an improved genetic algorithm for solving the multidimensional 0-1 knapsack problem. Furthermore, the efficiency of the presented method is investigated by comparing it with the traditional simple genetic algorithm and other latest methods, in respect of the accuracy of an approximate solution and the processing time through series of numerical experiments.
%K Multidimensional 0-1 knapsack problem
%K Genetic algorithms
%K Median crossover<br>多维0-1背包问题
%K 遗传算法
%K 中值杂交算子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=425928218C8D0859&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=DF92D298D3FF1E6E&sid=1D67BE204FBF4800&eid=E089FDF3CDAE8561&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10