Berth allocation with service priority

Akio Imai

doi:10.1016/S0191-2615(02)00023-1

Return

Berth allocation with service priority

2003-06-01

252

Akio Imai *

Etsuko Nishimura

Stratos Papadimitriou

DOI：10.1016/S0191-2615(02)00023-1

Original

Save

View PDF

Abstract

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.

Keywords:

berth allocation

terminal management

container transportation

cargo handling

heuristic

mathematical programming

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.