Academic Journals Database
Disseminating quality controlled scientific knowledge

A algorithm for the Vehicle Problem

ADD TO MY LIST
 
Author(s): Aziz Ezzatneshan

Journal: International Journal of Advanced Robotic Systems
ISSN 1729-8806

Volume: 7;
Issue: 2;
Date: 2010;
Original page

Keywords: Hybrid algorithm; Vehicle Routing problem; Ant Colony Optimization.

ABSTRACT
In this paper, we propose a hybrid ACO algorithm for solving vehicle routing problem (VRP) heuristically in combination with an exact In the basic VRP, geographically scattered customers of known demand are supplied from a single depot by a fleet of identically capacitated vehicles. The intuition of the proposed algorithm is that nodes which are near to each other will probably belong to the same branch of the minimum spanning tree of the problem graph and thus will probably belong to the same route in VRP. Given a clustering of client nodes, the solution is to find a route in these clusters by using ACO with a modified version of transition rule of the ants. At the end of each iteration, ACO tries to improve the quality of solutions by using a local search algorithm, and update the associated weights of the graph arcs.
Save time & money - Smart Internet Solutions      Why do you need a reservation system?