Ant colony optimisation based heuristic for one-sided time constraint vehicle routing problem

M. Saravanan and K.A. Sundararaman

International Journal of Services, Economics and Management, 2010, vol. 2, issue 3/4, 332-349

Abstract: In this paper, an approach based on Ant Colony Optimisation (ACO) is described for one-sided time constraint Vehicle Routing Problem (VRP), where the delivery of products from the depot to distribution centres has to take place within the maximum permissible time. The problem is described with the aim to achieve maximum customer satisfaction and to develop a solution strategy based on ACO. Here, ACO-based approach is compared with heuristic based on shortest path approach. With the help of computational experiments, it is found that ACO-based approach is more effective approach than the heuristic approach for VRP with one-sided time constraint.

Keywords: vehicle routing problem; ant colony optimisation; ACO: heuristics; metaheuristics; time constraints; customer satisfaction. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=33371 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injsem:v:2:y:2010:i:3/4:p:332-349

Access Statistics for this article

More articles in International Journal of Services, Economics and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().