Metaheuristic for solving routing problem in logistics management
by M. Rajmohan, P. Shahabudeen
International Journal of Operational Research (IJOR), Vol. 6, No. 2, 2009

Abstract: Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is one of the major logistics problems In this paper a two phase heuristics is proposed in which the customers are assigned to the depot in the first phase The routes are constructed with modified ant colony optimisation procedure and are improved using 2-Opt procedure in phase two The proposed heuristic has been applied to Cordeau MDVRPTW benchmark problems It is found that the proposed heuristic gives promising and better results, on an average, as compared to those solutions given by the existing heuristic for the MDVRPTW.

Online publication date: Fri, 19-Jun-2009

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 Operational Research (IJOR):
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