Abstract
This chapter considers the ECR problem in a hub-and-spoke transportation system over an infinite time horizon. Similar to the methodology in Chap. 4, we take the perspective of continuous review and discrete state to formulate an event-driven Markov decision model. The empty repositioning decisions are made at each epoch when the system state changes. To overcome the computational complexity of the stochastic dynamic programming model, we propose a dynamic decomposition procedure, whose computational complexity is linear in the number of spokes and can be calculated offline. The requirement for online calculation and data communication is very low. We analyze the structures of the dynamic decomposition policy and show that the dynamic decomposition policy has the same asymptotic behaviors as the optimal ECR policy. The proposed dynamic decomposition procedure can be applied to both discounted cost and long-run average cost cases. Numerical experiments demonstrate the effectiveness of the dynamic decomposition policy and its robustness against the assumption of the distribution types in terms of the laden container arrivals and the empty container transfer times. The model is then extended to the cases with external supply and demand of empty containers at all depots, where empty containers may exit and enter the two-depot shuttle system randomly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bertsekas, D. P. (1976). Dynamic programming and stochastic control. Academic Press.
Bertsekas, D. P. (1987). Dynamic programming: Deterministic and stochastic models. Prentice-Hall.
Cassandras, C. G., & Lafortune, S. (1999). Introduction to discrete event systems. Kluwer.
Du, Y. F., & Hall, R. W. (1997). Fleet sizing and empty equipment redistribution for center-terminal transportation networks. Management Science, 43(2), 145–157.
Godfrey, G., & Powell, W. B. (2002). An adaptive dynamic programming algorithm for single-period fleet management problems II: Multiperiod travel times. Transportation Science, 36(1), 40–54.
Hall, R. W., & Zhong, H. S. (2002). Decentralized inventory control policies for equipment management in a many-to-many network. Transportation Research Part A, 36, 849–865.
Powell, W. B. (2011). Approximate dynamic programming. Wiley.
Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. Wiley.
Song, D. P., & Carter, J. (2008). Optimal empty vehicle redistribution for hub-and-spoke transportation systems. Naval Research Logistics, 55(2), 156–171.
Song, D. P., & Earl, C. F. (2008). Optimal empty vehicle repositioning and fleet-sizing for two-depot service systems. European Journal of Operational Research, 185(2), 760–777.
Sutton, R., & Barto, A. (2018). Reinforcement learning (2nd ed.). The MIT Press.
Topaloglu, H., & Powell, W. B. (2006). Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. Informs Journal on Computing, 18(1), 31–42.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Song, DP., Dong, J. (2022). Optimal and Near-Optimal ECR Policies in Hub-and-Spoke Systems: Continuous Review. In: Modelling Empty Container Repositioning Logistics. Springer, Cham. https://doi.org/10.1007/978-3-030-93383-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-93383-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-93382-1
Online ISBN: 978-3-030-93383-8
eBook Packages: Business and ManagementBusiness and Management (R0)