Subscribe Now Subscribe Today
Research Article
 

Combined Optimization of Fixed-partition and Integral-ratio Horizon Policy for the Three-echelon Inventory Routing Problem



Fu Cheng-Hong
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
ABSTRACT

Inventory and transportation cost the main expenses of logistics. A new combined optimization policy is researched in this study, on the Inventory Routing Problem (IRP) in a three-echelon distribution system, which composed of a vendor, a Distribution Center (DC) and multiple geographically dispersed retailers. In the system, each retailer faces a deterministic, retailer-different rate and same type of product demand. Any retailer’s demand must be replenished from the DC, not permitted from the vendor directly. The stocks may be kept at any retailers or the DC. The objective is to determine a combined transportation (routing) and inventory policy to minimize a long horizon average system cost without shortage or delay. After discussing the characteristics of Fixed-Partition and Integral-Ratio Horizon (FP-IRH) method, the model for the IRP of three-echelon system is constructed. Then, a decomposition solution is proved, where the retailers are partitioned into disjoint and collectively exhaustive sets and each partition of retailers is served on a separate route. Given a fixed partition, the original problem is decomposed into two-echelon sub-problems and the efficient algorithms are designed for the three-echelon IRP by developing solution of the famous Vehicle Routing Problem (VRP). The computational results for a testing example problem show that the FP-IRH policy is more effective.

Services
Related Articles in ASCI
Similar Articles in this Journal
Search in Google Scholar
View Citation
Report Citation

 
  How to cite this article:

Fu Cheng-Hong , 2013. Combined Optimization of Fixed-partition and Integral-ratio Horizon Policy for the Three-echelon Inventory Routing Problem. Journal of Applied Sciences, 13: 2239-2245.

DOI: 10.3923/jas.2013.2239.2245

URL: https://scialert.net/abstract/?doi=jas.2013.2239.2245
 

REFERENCES
Abdul-Jalbar, B., A. Segerstedt, J. Sicilia and A. Nilsson, 2010. A new heuristic to solve the one-arehouse N-retailer problem. Comput. Operations Res., 37: 265-272.
CrossRef  |  Direct Link  |  

Andersson, H., A. Hoff, M. Christiansen, G. Hasle and A. Lokketangen, 2010. Industrial aspects and literature survey: Combined inventory management and routing. Comput. Operations Res., 37: 1515-1536.
CrossRef  |  

Bidhandi, H.M. and R.M. Yusuff, 2011. Integrated supply chain planning under uncertainty using an improved stochastic approach. Applied Math. Model., 35: 2618-2630.
CrossRef  |  Direct Link  |  

Chan, L.M.A. and D. Simchi-Levi, 1998. Probabilistic analyses and algorithms for three-echelon distribution systems. Manage. Sci., 44: 1562-1576.
CrossRef  |  Direct Link  |  

Cheng-Hong, F. and F. Zhuo, 2010. An improved tabu search algorithm with adjacent information for capacitated vehicle routing problem. Syst. Eng., 28: 81-84.

Hemmelmayr, V., K.F. Doerner, R.F. Hartl and M.W.P. Savelsbergh, 2010. Vendor managed inventory for environments with stochastic product usage. Eur. J. Operational Res., 202: 686-695.
CrossRef  |  Direct Link  |  

Herer, Y.T. and R. Levy, 1997. The metered inventory routing problem, an integrative heuristic algorithm. Int. J. Prod. Econ., 51: 69-81.
CrossRef  |  Direct Link  |  

Li, J., F. Chu and H. Chen, 2011. A solution approach to the inventory routing problem in a three-echelon distribution system. Eur. J. Operational Res., 210: 736-744.
Direct Link  |  

Shen, S.Y. and M. Honda, 2009. Incorporating lateral transfers of vehicles and inventory into an integrated replenishment and routing plan for a three-echelon supply chain. Comput. Ind. Eng., 56: 754-775.
CrossRef  |  Direct Link  |  

Zhao, Q.H., S. Chen and C.X. Zang, 2008. Model and algorithm for inventory/routing decision in a three-echelon logistics system. Eur. J. Operational Res., 191: 623-635.
CrossRef  |  Direct Link  |  

©  2020 Science Alert. All Rights Reserved