基于离散哈里斯鹰优化算法求解具有 单连续变量的背包问题.

In order to use Harris hawks optimization ( HHO) to solve KPC, this paper proposed a new discrete Harris hawks optimization ( DisHHO ) algorithm. DisHHO encoded individual based on 0-1 vector and established the discrete evolution equations by bitwise operation. Furthermore, it used an adaptive mutation mechanism to improve the search performance. For verifying the performance of DisHHO in solving KPC, it was used to solve four kinds of large -scale KPC instances. The comparison with the existing binary HHO and state-of-the-art algorithms for solving KPC show that DisHHO not only has excellent average calculation results, but also has fast calculation speed. Hence, DisHHO is a new and efficient algorithm for solving KPC. [ABSTRACT FROM AUTHOR]