Algorithm for the Inventory-Routing Problem Based on R-System

Article Preview

Abstract:

The inventory-routing problem is an important approach for the enterprises to save energy and improve efficiency. The improvement of the utilization rate of vehicles and the reduction of the dispatching cost can be realized by solving this problem effectively. This thesis focuses on the inventory-routing problem and put forward a heuristic algorithm based on the greedy rules whose key strategy is to cycle select the Hamilton transportation route with the current lowest unit cost. The simulation example indicates that this algorithm can effectively improve the trucking efficiency and save the transporting cost.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

312-316

Citation:

Online since:

March 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] FU Cheng-hong, FU Zhuo. Inventory routing problem and its recent development: Review, Journal of Computer Applications, 2010, (2): 453~457.

DOI: 10.3724/sp.j.1087.2010.00453

Google Scholar

[2] SPERANZA M G, UKOVICH W. Minimizing Transportation and Inventory Costs for Several Products on A Single Link, Operations Research, 1994, 42(5): 879~894.

DOI: 10.1287/opre.42.5.879

Google Scholar

[3] CHIEN W, BALAKRISHNAN A, WONG R. An Integrated Inventory Allocation and Vehicle Routing Problem, Transportation Science, 1989, 23(2): 67~76.

DOI: 10.1287/trsc.23.2.67

Google Scholar

[4] DROR M, BALL M. Inventory Routing: Reduction from an Annual to a Short-period Problem, Naval Research Logistics, 1987, 34(6): 891~905.

DOI: 10.1002/1520-6750(198712)34:6<891::aid-nav3220340613>3.0.co;2-j

Google Scholar

[5] Fei XI, Zhou Yong-wu. Optimal policy of inventory routing problem based on fixed partition, Systems Engineering and Electronics, 2009, (10): 2389~2993.

Google Scholar

[6] Federgruen A, Zipkin P. A Combined Vehicle Routing and Inventory Allocation Problem, Operations Research, 1984, 32(5): 192~213.

DOI: 10.1287/opre.32.5.1019

Google Scholar