Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm

Authors:
Bahriye Akay;Dervis Karaboga
Affiliations:
The Dept. of Computer Engineering, Erciyes University, Melikgazi, Turkiye 38039;The Dept. of Computer Engineering, Erciyes University, Melikgazi, Turkiye 38039
Venue:
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Year:
2009

Citing 4
Cited 5

Reaction-Diffusion Model of a Honeybee Colony's Foraging Behaviour

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
An Evolutionary Algorithm for Integer Programming

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Particle swarm optimization for integer programming

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Quantum-Behaved particle swarm optimization for integer programming

ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II

New inspirations in swarm intelligence: a survey

International Journal of Bio-Inspired Computation
A novel non-Lyapunov approach through artificial bee colony algorithm for detecting unstable periodic orbits with high orders

Expert Systems with Applications: An International Journal
Artificial bee colony algorithm: a survey

International Journal of Advanced Intelligence Paradigms
Synergizing fitness learning with proximity-based food source selection in artificial bee colony algorithm for numerical optimization

Applied Soft Computing
Emergency railway wagon scheduling by hybrid biogeography-based optimization

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a study that applies the Artificial Bee Colony algorithm to integer programming problems and compares its performance with those of Particle Swarm Optimization algorithm variants and Branch and Bound technique presented to the literature. In order to cope with integer programming problems, in neighbour solution production unit, solutions are truncated to the nearest integer values. The experimental results show that Artificial Bee Colony algorithm can handle integer programming problems efficiently and Artificial Bee Colony algorithm can be considered to be very robust by the statistics calculated such as mean, median, standard deviation.