%0 Journal Article %A CAI Xiufeng %A HE Yichao %A LIU Xuejing %A LU Fengjia %A WU Congcong %T Differential crow search algorithm based on Lévy flight for solving discount {0-1} knapsack problem %D 2018 %R 10.11772/j.issn.1001-9081.2017071852 %J Journal of Computer Applications %P 433-442 %V 38 %N 2 %X A large-scale Discount {0-1} Knapsack Problem (D{0-1} KP) is difficult to solve with the deterministic algorithms, thus a differential crow search algorithm based on Lévy flight named LDECSA was proposed. Firstly, the coding problem about the second mathematical model of D{0-1} KP was solved by using mixed coding. Secondly, a New greedy Repair and Optimization Algorithm (NROA) was used to deal with the infeasible solution. Thirdly, in order to avoid the problems of local optimum and slow convergence, Lévy flight and differential strategy were introduced. Finally, the reasonable value of awareness probability and flight length were determined through experiments, the differential strategy was also chosen. The experimental results on four types of large-scale D{0-1} KP show that LDECSA is very suitable for solving large-scale D{0-1} KP with very satisfactory approximate solution. %U http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2017071852