.png){kind=icon}
返回
An optimization heuristic for the berth scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.03.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Berths are among the most important resources in a port. In this research we present an optimization-based approach for the berth scheduling problem, which is to determine the berthing time and space for each incoming ship. The neighborhood-search based heuristic treats the quay as a continuous space. in additional to basic physical requirements, this model takes several factors important in practice into consideration, including the first-come-first-served rule, clearance distance between ships, and possibility of ship shifting. Computational experience is provided. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Logistics
Berthing
Threshold accepting
Integer programming
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
The role of carbonate radical in limiting the persistence of sulfur-containing chemicals in sunlit natural waters.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏分享收藏
查看更多内容