Artificial bee colony algorithm for the capacitated vehicle routing problem

Authors:
Ivona Brajevic
Affiliations:
Faculty of Mathematics, University of Belgrade, Serbia
Venue:
ECC'11 Proceedings of the 5th European conference on European computing conference
Year:
2011

Citing 8
Cited 2

Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
On the performance of artificial bee colony (ABC) algorithm

Applied Soft Computing
An analysis of different variations of ant colony optimization to the minimum weight vertex cover problem

WSEAS Transactions on Information Science and Applications
Honey Bees Mating Optimization algorithm for large scale vehicle routing problems

Natural Computing: an international journal
Providing flexibility in the vehicle route optimization for the AVL based transport monitoring system

WSEAS Transactions on Computers
An object-oriented software implementation of a modified artificial bee colony (ABC) algorithm

NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
Parallelization of the artificial bee colony (ABC) algorithm

NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems

Applied Soft Computing

Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm

Expert Systems with Applications: An International Journal
Artificial bee colony for the standard cell placement problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented for rather different type of problems and tested on twelve benchmark instances of small scale problems. Our results were compared to the best known results. The computational study showed that the proposed algorithm is a good and promising approach for capacitated vehicle routing problem.