期刊
TRANSPORTATION SCIENCE
卷 54, 期 6, 页码 1697-1713出版社
INFORMS
DOI: 10.1287/trsc.2020.0980
关键词
empty container repositioning; dynamic pricing; Markey decision process; L-#-concavity; approximate dynamic programming; duality
资金
- Research Grants Council of the Hong Kong Special Administrative Region of the People's Republic of China [T32-620/11]
- Center for Maritime Studies
- Singapore Maritime Institute
This paper studies joint decisions on pricing and empty container repositioning in two-depot shipping services with stochastic shipping demand. We formulate the problem as a stochastic dynamic programming model. The exact dynamic program may have a high-dimensional state space because of the in-transit containers. To cope with the curse of dimensionality, we develop an approximate model where the number of in-transit containers on each vessel is approximated with a fixed container flow predetermined by solving a static version of the problem. Moreover, we show that the approximate value function is L-#-concave, thereby characterizing the structure of the optimal control policy for the approximate model. With the upper bound obtained by solving the information relaxation-based dual of the exact dynamic program, we numerically show that the control policies generated from our approximate model are close to optimal when transit times span multiple periods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据