An Efficient Solution for the VRP by Using a Hybrid Elite Ant System

The vehicle routing problem (VRP) is a well-known NP-Hard problemin operation research which has drawn enormous interest from many researchers duringthe last decades because of its vital role in planning of distribution systems andlogistics. This article presents a modified version of the elite ant...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computers, communications & control communications & control, 2014-06, Vol.9 (3), p.340
Main Authors: Yousefikhoshbakht, Majid, Didehvar, Farzad, Rahmati, Farhad
Format: Article
Language:English
Subjects:
Algorithms
Hybrid systems
Route planning
Routing
Vehicle routing
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The vehicle routing problem (VRP) is a well-known NP-Hard problemin operation research which has drawn enormous interest from many researchers duringthe last decades because of its vital role in planning of distribution systems andlogistics. This article presents a modified version of the elite ant system (EAS) algorithmcalled HEAS for solving the VRP. The new version mixed with insert and swapalgorithms utilizes an effective criterion for escaping from the local optimum points.In contrast to the classical EAS, the proposed algorithm uses only a global updatingwhich will increase pheromone on the edges of the best (i.e. the shortest) route andwill at the same time decrease the amount of pheromone on the edges of the worst(i.e. the longest) route. The proposed algorithm was tested using fourteen instancesavailable from the literature and their results were compared with other well-knownmeta-heuristic algorithms. Results show that the suggested approach is quite effectiveas it provides solutions which are competitive with the best known algorithms in theliterature.
ISSN:1841-9836
1841-9844
DOI:10.15837/ijccc.2014.3.161