Marine container terminal configurations for efficient handling of mega-containerships

被引:56
作者
Imai, Akio [1 ]
Nishimura, Etsuko [1 ]
Papadimitriou, Stratos [2 ]
机构
[1] Kobe Univ, Grad Sch Maritime Sci, Higashinada Ku, Kobe, Hyogo 6580022, Japan
[2] Univ Piraeus, Dept Maritime Studies, GR-18532 Piraeus, Greece
关键词
Berth allocation problem; Mega-containership; Mathematical programming; Genetic algorithm; BERTH-ALLOCATION PROBLEM; PORT;
D O I
10.1016/j.tre.2012.07.006
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper addresses two innovative design alternatives of marine container terminals for efficient ship handling service in the mega-containership era. They serve a mega-ship from two sides at dedicated berths. One of the key issues for higher utilization is how the dedicated berths serve other ships efficiently when they are idle. For this, we develop efficient heuristics for the berth allocation of the two terminals to identify a more productive terminal among them in terms of the total service time of both ordinary and mega-ships. A wide variety of experiments show the channel terminal is the most preferred. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:141 / 158
页数:18
相关论文
共 23 条
[1]   A greedy genetic algorithm for the quadratic assignment problem [J].
Ahuja, RK ;
Orlin, JB ;
Tiwari, A .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) :917-934
[2]   Models for the discrete berth allocation problem: A computational comparison [J].
Buhrkal, Katja ;
Zuglian, Sara ;
Ropke, Stefan ;
Larsen, Jesper ;
Lusby, Richard .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (04) :461-473
[3]   Multi-objective and prioritized berth allocation in container ports [J].
Cheong, C. Y. ;
Tan, K. C. ;
Liu, D. K. ;
Lin, C. J. .
ANNALS OF OPERATIONS RESEARCH, 2010, 180 (01) :63-103
[4]   Models and tabu search heuristics for the Berth-allocation problem [J].
Cordeau, JF ;
Laporte, G ;
Legato, P ;
Moccia, L .
TRANSPORTATION SCIENCE, 2005, 39 (04) :526-538
[5]  
Goldberg Jr D.E., 1985, P 1 INT C GEN ALG TH, V154, P154
[6]   A lamda-optimal based heuristic for the berth scheduling problem [J].
Golias, Mihalis M. ;
Boile, Maria ;
Theofanis, Sotirios .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2010, 18 (05) :794-806
[7]   Berth scheduling by customer service differentiation: A multi-objective approach [J].
Golias, Mihalis M. ;
Boile, Maria ;
Theofanis, Sotirios .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2009, 45 (06) :878-892
[8]   A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis [J].
Guan, YP ;
Xiao, WQ ;
Cheung, RK ;
Li, CL .
OPERATIONS RESEARCH LETTERS, 2002, 30 (05) :343-350
[9]   The dynamic berth allocation problem for a container port (vol 35, pg 401, 2001) [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) :197-197
[10]   Berth allocation in a container port: using a continuous location space approach [J].
Imai, A ;
Sun, X ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) :199-221