Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem
INFORMS Journal on Computing
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Compact Multiagent System based on Autonomy Oriented Computing
IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
Artificial bee colony algorithm: a survey
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.01 |
In this paper we have proposed a new hybrid approach combining artificial bee colony algorithm with a greedy heuristic and a local search for the quadratic knapsack problem. Quadratic knapsack problem belongs to traditional knapsack problem family and it is an extension of the well-known 0/1 knapsack problem. In this problem profits are also associated with pairs of objects along with individual objects. As this problem is an extension of the 0/1 knapsack problem, it is also $\mathcal{NP}$-Hard. Artificial bee colony algorithm is a new swarm intelligence technique inspired by foraging behavior of natural honey bee swarms. Performance of our algorithm on standard quadratic knapsack problem instances is compared with the other best heuristic techniques. Results obtained on these instances show that our hybrid artificial bee colony algorithm is superior to these techniques in many aspects.