Large scale inventory routing problem with split delivery: a new model and Lagrangian relaxation approach
by Yugang Yu, Haoxun Chen, Feng Chu
International Journal of Services Operations and Informatics (IJSOI), Vol. 1, No. 3, 2006

Abstract: The Inventory Routing Problem (IRP) integrates inventory planning with vehicle routing to minimise total logistics cost by coordinating inventory and transportation activities. Due to its complexity, an approximate model with new subtour elimination constraints is proposed for IRP with split delivery. Lagrangian Relaxation (LR) is used to decompose the model into subproblems that are solved by linear programming and Minimum Cost Flow (MCF) algorithms. A near-optimal solution of the model is constructed from the solution of the relaxed problem using a heuristic. The solution, which defines for each period the delivery volume for each customer, the number of times traversed by vehicles and the total quantity transported on each directed arc in the corresponding transportation network, is repaired to a feasible solution of the IRP by solving a series of assignment problems. Numerical experiments show that the proposed approach can find near-optimal solutions for the IRP with up to 200 customers in a reasonable computation time.

Online publication date: Tue, 03-Oct-2006

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 Services Operations and Informatics (IJSOI):
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