.png){kind=icon}
返回
A robust approximation for yard template optimization under uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trb.2022.03.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers a container yard template optimization problem when the arrival schedule of vessels calling at the port is uncertain. First, container storage locations in the yard need to be assigned to vessels, which essentially forms the yard template. When the arrival of the vessels becomes firmed, the operation schedule to store and retrieve containers from the yard is determined, taking into account the vessel turnaround time requirements and activity congestion in the yard. We develop a two-stage robust approximation model in the form of a single linear mixed integer program to minimize the maximum cost associated with excessive activity concentrations and travel distance from the vessel berth to the container storage locations. An accelerated column generation meta-heuristic solution approach is then proposed, which integrates adaptive large neighborhood search, evolutionary algorithm, and column generation algorithm to generate near-optimal solutions in a reasonable time. Numerical results show that the proposed solution algorithm performs favorably compared to other standalone approaches.
Keyword:
Robust optimization
Column generation
Yard template
Port operation
Mixed integer programming
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
Improved Benders decomposition for stochastic yard template planning in container terminals集装箱码头随机堆场模板规划的改进Benders分解
.png){kind=icon}
PREAI
分享收藏Storage yard operations in container terminals: Literature overview, trends, and research directions
OAAI
OAAI分享收藏
查看更多内容