蜂群遗传算法求解多选择背包问题

Multiple-Choice Knapsack problem (MCKP) is NP hard as one of combinatorial optimization． This paper proposed a Bee-Swarm Genetic Algorithm (BSGA) to solve MCKP． There are two adaptive populations in BSGA, male bee swarm crossover with queen to keep pressure of selection, female swarm mutate to keep population diversity, the queen evolutes under the instruction of heuristic rules, the algorithm uses the coding method based on permutation. It presented the main idea of BSGA and implemented by MATLAB．Through a kind of instances，BSGA compared with other algorithms in the literature，and it shows the feasibility and effectiveness of the proposed algorithm, and expands applications of BSGA.