Bacterial Foraging Algorithm for 0-1 Knapsack Problem
0-1 knapsack problem is a classical N-P Problem in combinatorial optimization which has been used in many fields.It has great significance in solving the problem efficiently.This paper introduces a new optimization algorithm-Bacterial foraging optimization (BFO)to solve the 0-1 knapsack problem.Through numerical simulations and comparisons with that of other algorithms,it shows the effectiveness and validity of the method.
NETL
NSTL
万方数据
维普
