Optimal policies for the berth allocation problem under stochastic nature
详细信息 查看全文
- 作者：Evrim Ursavas e.ursavas@rug.nl" class="auth_mail" title="E-mail the corresponding author ; Stuart X. Zhu ; x.zhu@rug.nl" class="auth_mail" title="E-mail the corresponding author
- 关键词：Pricing ; Inventory ; Return and expediting ; Stochastic dynamic programing ; Optimization
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 December 2016
- 年：2016
- 卷：255
- 期：2
- 页码：380-387
- 全文大小：501 K
文摘
- •
This study proposes a framework based on stochastic dynamic programming approach to model the berth allocation problem.
- •
We characterize optimal polices under stochastic arrival and handling times for different types of calling vessels.
- •
We find that the optimal control policy is of threshold type depending on the number of vessels in a certain berth group.
- •
The derived policies can be used at container terminals for the optimal use of their berthing facilities.