EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2472. Approximate dynamic programming for inland empty container inventory management
Invited abstract in session MA-3: Industrial Optimization, stream Data Science Meets Optimization.
Monday, 8:30-10:00Room: 1005 (building: 202)
Authors (first author is the speaker)
1. | Sangmin Lee
|
Mathematical Sciences, University of Copenhagen, Maersk | |
2. | Trine Krogh Boomsma
|
Department of Mathematical Sciences, University of Copenhagen |
Abstract
Empty container repositioning (ECR) is crucial in handling global trade imbalances by managing the flow and storage of empty containers to effectively accommodate customer demands and returns. We formulate a Markov decision process that accounts for practical characteristics of ECR, including multiple transportation modes and lead times, and uncertainty and serial correlation in net container inflows. To determine a cost-minimising repositioning policy for real-life scenarios, we employ a stochastic approximate dynamic programming approach, integrated with statistical techniques, such as convex regression and Latin hyper cube sampling. We highlight the advantages of incorporating exogenous variables into the approximation model. A case study with historical daily data on empty container in- and out-flows demonstrates the effective control of on-hand inventory levels while optimising holding and leasing costs. Moreover, we quantify the benefits of leveraging all transportation modes, with cost reduction potentials of up to 26.05%. Finally, we evaluate the robustness of our algorithm under variations in key parameters.
Keywords
- Programming, Dynamic
- Optimal Control
- Machine Learning
Status: accepted
Back to the list of papers