Discrete Artificial Bee Colony Algorithm for Multiple Knapsack Problems

摘要

The Multiple Knap sack Problem (MKP) is a NPhard combinatorial optimization problem in many realword applications. Artificial Bee Colony (ABC) algorithm which is one of the most recently introduced optimization algorithms is based on the intelligent behavior of honey bee swarm. Combinatorial optimization problem is transformed to searching farina for honey bees, based on the analysis of nectar searching, and new discrete artificial bee colony algorithm is analyzed. Dynamic renew formula of transforming factor and transferring formula of state are established and three regenerative strategies of leading factor are concluded. Experiment results show that the algorithm can quickly find optimal solution. The proposed algorithm can also be applied to other constrained combinatorial optimization problems.