.png){kind=icon}
返回
A bi-objective model for robust berth allocation scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2012.03.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Berth allocation is an important port operation problem for container terminals. This paper studies how to develop a robust schedule for berth allocation that incorporates a degree of anticipation of uncertainty (e.g., vessels' arrival time and operation time) during the schedule's execution. This study proposes a bi-objective optimization model for minimizing cost and maximizing robustness of schedules. A heuristic is also developed for solving the hi-objective model in large-scale problem cases. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed model and method. Managerial implications are also discussed. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Port operation
Berth allocation
Proactive scheduling
Multi-objective optimization
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容