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: | , , , |
---|---|
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 |
id |
doaj-2383527f634e4d32a517feaa788fcc0b |
---|---|
record_format |
Article |
spelling |
doaj-2383527f634e4d32a517feaa788fcc0b2020-11-25T00:34:41ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472013-01-01201310.1155/2013/676275676275Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack ProblemJunzhong Ji0Hongkai Wei1Chunnian Liu2Baocai Yin3College of Computer Science and Technology, Beijing University of Technology, Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing 100124, ChinaCollege of Computer Science and Technology, Beijing University of Technology, Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing 100124, ChinaCollege of Computer Science and Technology, Beijing University of Technology, Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing 100124, ChinaCollege of Computer Science and Technology, Beijing University of Technology, Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, Beijing 100124, ChinaGiven 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) 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.http://dx.doi.org/10.1155/2013/676275 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Junzhong Ji Hongkai Wei Chunnian Liu Baocai Yin |
spellingShingle |
Junzhong Ji Hongkai Wei Chunnian Liu Baocai Yin Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem Mathematical Problems in Engineering |
author_facet |
Junzhong Ji Hongkai Wei Chunnian Liu Baocai Yin |
author_sort |
Junzhong Ji |
title |
Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem |
title_short |
Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem |
title_full |
Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem |
title_fullStr |
Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem |
title_full_unstemmed |
Artificial Bee Colony Algorithm Merged with Pheromone Communication Mechanism for the 0-1 Multidimensional Knapsack Problem |
title_sort |
artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2013-01-01 |
description |
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) 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. |
url |
http://dx.doi.org/10.1155/2013/676275 |
work_keys_str_mv |
AT junzhongji artificialbeecolonyalgorithmmergedwithpheromonecommunicationmechanismforthe01multidimensionalknapsackproblem AT hongkaiwei artificialbeecolonyalgorithmmergedwithpheromonecommunicationmechanismforthe01multidimensionalknapsackproblem AT chunnianliu artificialbeecolonyalgorithmmergedwithpheromonecommunicationmechanismforthe01multidimensionalknapsackproblem AT baocaiyin artificialbeecolonyalgorithmmergedwithpheromonecommunicationmechanismforthe01multidimensionalknapsackproblem |
_version_ |
1725312081610145792 |