Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem
Given a set of n objects, 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 satisfying m knapsack constraints. In this paper, we have proposed a new artificial bee colony (ABC)...
Main Authors: | Junzhong Ji, Hongkai Wei, Chunnian Liu, Baocai Yin |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2013/676275 |
Similar Items
-
A Discrete Improved Artificial Bee Colony Algorithm for 0–1 Knapsack Problem
by: Song Zhang, et al.
Published: (2019-01-01) -
Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony Pheromone
by: Abdul Hadi Alaidi, et al.
Published: (2021-08-01) -
An ant colony optimization algorithm for the zero-one Multidimensional Knapsack Problem
by: Cheng-Yu Hsu, et al.
Published: (2003) -
HONEY BEE COLONY PHEROMONES
by: M Dražić, et al.
Published: (2001-09-01) -
A Memetic Lagrangian Heuristic for the 0-1 Multidimensional
Knapsack Problem
by: Yourim Yoon, et al.
Published: (2013-01-01)