An improved binary artificial bee colony algorithm for solving multidimensional knapsack problem

2021 ◽  
Author(s):  
yao wei
Keyword(s):  
Knapsack Problem ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Multidimensional Knapsack Problem ◽  
Bee Colony ◽  
Multidimensional Knapsack

scholarly journals Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Junzhong Ji ◽  
Hongkai Wei ◽  
Chunnian Liu ◽  
Baocai Yin
Keyword(s):  
Knapsack Problem ◽  
Artificial Bee Colony ◽  
Multidimensional Knapsack Problem ◽  
Abc Algorithm ◽  
Knapsack Constraints ◽  
Bee Colony ◽  
Multidimensional Knapsack ◽  
Communication Mechanism ◽  
Total Profit ◽  
And Diffusion

Given a set ofnobjects, the objective of the 0-1 multidimensional knapsack problem (MKP_01) is to find a subset of the object set that maximizes the total profit of the objects in the subset while satisfyingmknapsack constraints. In this paper, we have proposed a new artificial bee colony (ABC) algorithm for the MKP_01. The new ABC algorithm introduces a novel communication mechanism among bees, which bases on the updating and diffusion of inductive pheromone produced by bees. In a number of experiments and comparisons, our approach obtains better quality solutions in shorter time than the ABC algorithm without the mechanism. We have also compared the solution performance of our approach against some stochastic approaches recently reported in the literature. Computational results demonstrate the superiority of the new ABC approach over all the other approaches.

Sign in / Sign up

Export Citation Format

Share Document