Heuristic for solving routing problem in Supply Chain Management
by M. Rajmohan, P. Shahabudeen
International Journal of Applied Decision Sciences (IJADS), Vol. 1, No. 2, 2008

Abstract: Transportation costs constitute a significant fraction of total logistics cost in Supply Chain Management (SCM). To reduce transportation costs and to improve customer service, the optimal selection of the vehicle route is a frequent decision problem and this is commonly known as Vehicle Routing Problem (VRP). Vehicle Routing Problem with Time Windows (VRPTW) is an important variant of VRP and also a practical problem in real-world applications. Since VRPTW belongs to NP hard problem, development of heuristics is a prime concern. In this paper, an ant colony based heuristic is developed to solve VRPTW. The heuristic is tested with benchmark instances and provides improved solutions.

Online publication date: Tue, 16-Sep-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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 subs@inderscience.com