%0 Journal Article %A WU Congcong1 %A ZHAO Jianli1 %A 2 %A LIU Xuejing1 %A CHEN Yiying1 %T Modified differential evolution algorithm for solving multidimensional knapsack problem %D 2018 %R 10.3778/j.issn.1002-8331.1712-0355 %J Computer Engineering and Applications %P 153-160 %V 54 %N 11 %X Multidimensional Knapsack(MKP) is a typical NP-hard problem in combinatorial optimization problem. It is widely used in engineering and management. A Modified Binary Differential Evolution algorithm(MBDE) is proposed to solve the MKP problem. The key steps of the proposed algorithm can be divided into two parts: the binary group is generated; the candidate feasible solutions are obtained. The feasible solution is obtained by modifying the binary individual in the process of calculating the fitness value of the individual. An effective method for measuring the density of values is proposed for the repair of binary individuals. In addition,an opposite search strategy and an elite local search strategy are designed to improve accuracy and convergence speed of MBDE by increasing the exploration and the exploitment of the algorithm. To demonstrate the efficiency of MBDE, three sets of benchmark instances are solved and some comparisons with other methods available in literature are shown. MBDE algorithm obtains higher precision and running speed. The experimental results show that MBDE algorithm is very suitable for solving large-scale MKP problem. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1712-0355