Artificial bee colony algorithm for multi-choice knapsack problem
多选择背包问题的人工蜂群算法*

Multi-choice knapsack problem(MCKP) is NP hard as one of combinatorial optimization.This paper proposed a new intelligent optimization algorithm——artificial bee colony(ABC) algorithm to solve MCKP.The algorithm obtained global optimum through the local search of the employed bees,follower bees and scout bees.It presented the main idea of the algorithm for MCKP and implemented on microcomputer by MATLAB.Through a kind of computational instances,it compared with other algorithms,and it obtains the satisfactory results,which shows the feasibility and effectiveness of the proposed algorithm,expanding the applications of ABC.