arrow
返回

Berth allocation with service priority

delete2003-06-01
delete252
delete
OA
AI
A
Akio Imai *
E
Etsuko Nishimura
S
Stratos Papadimitriou
DOI:10.1016/S0191-2615(02)00023-1delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Over the past several years, port related charges in Japanese ports have been substantially higher than those charged in other major international hub ports. All major container ports in Japan feature so-called Dedicated Terminals in which cost-effectiveness is justified by huge container volume to be handled. One of the reasons cited ford high port charges is a relative decrease in handling volume compared to the terminal capacity, resulting in inefficient use of the existing capacity. The use of the Multi-User Container Terminal (MUT) concept employed in some of the major container hub ports such as Hong Kong, Pusan, Hamburg and Rotterdam reduces redundant terminal space and results in substantial cost savings in cargo handling costs and therefore is desired for ports in Japan as well. One of the key issues in the MUT operation is the berth allocation to calling vessels. In a recent study, an allocation problem for the MUT was examined, in which each vessel was treated equally. However, as some vessel operators desire high priority services, the goal of this paper is to modify the existing formulation of the berth allocation problem in order to treat calling vessels at various service priorities by developing a genetic algorithm based heuristic for the resulting non-linear problem. (C) 2003 Elsevier Science Ltd. All rights reserved.
Keyword:
berth allocation
terminal management
container transportation
cargo handling
heuristic
mathematical programming
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Transportation Research Part B-Methodological 封面图
Transportation Research Part B-Methodological
IF:
6.3
论文数:
3.6K
被引数:
1.9W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Strategic Terror
err
IF0
err2006-01-01
err0
PREAI
errBeau Grosscup
err分享
err收藏
学者 查看更多内容