Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
详细信息 查看全文
- 作者：Yavuz B. Tü ; rkoğullarıa ; yavuz.turkogullari@maltepe.edu.tr" class="auth_mail" title="E-mail the corresponding author ; Z. Caner Taşkın ; b ; caner.taskin@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author ; Necati Arasb ; arasn@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author ; İ. Kuban Altınelb ; altinel@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author
- 关键词：Integer programming ; Container terminal management ; Berth allocation ; Crane assignment ; Crane scheduling
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 November 2016
- 年：2016
- 卷：254
- 期：3
- 页码：985-1001
- 全文大小：1171 K
文摘
- •
We model a berth allocation, crane assignment and scheduling problem (BACASP).
- •
We devise a MILP formulation for the problem and propose a decomposition algorithm.
- •
Our method can deal with time-variant crane assignments and crane setup costs.
- •
We investigate NP-completeness of the crane scheduling subproblem.
- •
BACASP can be solved optimally for up to 60 vessels using our approach.