1. Binary Artificial Bee Colony Algorithm for Solving 0-1 Knapsack Problem
- Author
-
Chen HN(陈瀚宁), Liu W(刘微), and Niu B(牛奔)
- Subjects
Artificial bee colony algorithm ,Mathematical optimization ,General Computer Science ,Knapsack problem ,General Mathematics ,Particle swarm optimizer ,Genetic algorithm ,Comparison results ,Binary number ,Combinatorial optimization ,Multi-objective optimization ,Mathematics - Abstract
nIn this paper, a binary artificial bee colony (BABC) algorithm is proposed to solve the 0-1 Knapsack problem. Unlike the original ABC algorithm, the proposed BABC represents a food source as a discrete binary variable and applies discrete operators to change the foraging trajectories of the employed bees, onlookers and scouts in the probability that a coordinate will take on a zero or one value. To verify the performance of the proposed algorithms, we made a comparison between algorithms of the proposed BABC with the standard binary particle swarm optimizer (BPSO) and the genetic algorithm (BGA). The comparison results showed that the proposed algorithms outperform the BPSO and BGA in terms of quality of solution found.
- Published
- 2012
- Full Text
- View/download PDF