Optimization Approach for Multi-Stork Inventory Routing Problem

Article Preview

Abstract:

Inventory routing problem is one of the key issues to achieve integrated management of logistics. Solving this problem effectively, we can improve vehicle utilization, and reduce distribution costs. This paper, concerning the problem in inventory routing of multi-variety, multi-vendor to multi-customers, proposed heuristic algorithm based on greedy rules. The core strategy of the algorithm is to choose circularly the current lowest unit cost routine ---Hamilton delivery routes. Simulation shows that the algorithm reduces the unloaded ratio of truck, raises the efficiency of truck delivery and saves transport costs.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Pages:

1637-1640

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] KENDERDINE D J, LARSON P D. Quality and Logistics: A Framework for Strategic Integration[J]. International Journal of Physical Distribution and Materials Management, 1988, 18(7): 5~10.

DOI: 10.1108/eb014703

Google Scholar

[2] Chen Xue-ying. Study of the Inventory Routing Problem Based on Heuristics Theory [D], Beijing Jiaotong University, 2008. (5): 1~4. 33.

Google Scholar

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

DOI: 10.3724/sp.j.1087.2010.00453

Google Scholar

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

DOI: 10.1287/opre.42.5.879

Google Scholar

[5] DROR M, BALL M. Inventory Routing: Reduction From an Annual to A Short-period Problem [J]. 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

[6] BLANCHINI F, QUEYRANNE M, RINALDI F, et al. A Feedback Strategy for Periodic Network Flows[J]. Networks, 1996, 27(1): 25~34.

DOI: 10.1002/(sici)1097-0037(199601)27:1<25::aid-net3>3.0.co;2-g

Google Scholar

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

Google Scholar

[8] WU Xiu-huan; LI Yan-hui,. Model and Algorithm Based on Markov Decision Process for Stochastic Inventory Routing Problem [J]. Industrial Engineering and Management, 2009, (1): 66~70.

Google Scholar

[9] QU Yan-guo. Problem of Transport Efficiency in the Road Transport Logistics [J]. Comprehensive Transportation, 2004, (6): 52~55.

Google Scholar