Ant colony optimisation based heuristic for one-sided time constraint vehicle routing problem Online publication date: Tue, 01-Jun-2010
by M. Saravanan, K.A. Sundararaman
International Journal of Services, Economics and Management (IJSEM), Vol. 2, No. 3/4, 2010
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.
Online publication date: Tue, 01-Jun-2010
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services, Economics and Management (IJSEM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org