A decision model for berth allocation under uncertainty

被引:157
作者
Zhen, Lu [1 ]
Lee, Loo Hay [2 ]
Chew, Ek Peng [2 ]
机构
[1] Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
[2] Natl Univ Singapore, Dept Ind & Syst Engn, Singapore 117576, Singapore
关键词
Scheduling; Port operation; Berth allocation; Container terminals; Meta-heuristic; CONTAINER TERMINALS; SCHEDULING METHOD; SEARCH; PORT; OPTIMIZATION; HEURISTICS; SYSTEM;
D O I
10.1016/j.ejor.2011.01.021
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies the berth allocation problem (BAP) under uncertain arrival time or operation time of vessels. It does not only concern the proactive strategy to develop an initial schedule that incorporates a degree of anticipation of uncertainty during the schedule's execution, but also studies the reactive recovery strategy which adjusts the initial schedule to handle realistic scenarios with minimum penalty cost of deviating from the initial schedule. A two-stage decision model is developed for the BAP under uncertainties. Moreover, a meta-heuristic approach is proposed for solving the above problem in large-scale realistic environments. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed method. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:54 / 68
页数:15
相关论文
共 21 条
[1]   VALUE OF INFORMATION AND STOCHASTIC PROGRAMMING [J].
AVRIEL, M ;
WILLIAMS, AC .
OPERATIONS RESEARCH, 1970, 18 (05) :947-&
[2]   A survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :615-627
[3]   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
[4]   The berth allocation problem: models and solution methods [J].
Guan, YP ;
Cheung, RK .
OR SPECTRUM, 2004, 26 (01) :75-92
[5]   Variable neighborhood search for minimum cost berth allocation [J].
Hansen, Pierre ;
Oguz, Ceyda ;
Mladenovic, Nenad .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (03) :636-649
[6]   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
[7]   Efficient planning of berth allocation for container terminals in Asia [J].
Imai, A ;
Nagaiwa, K ;
Tat, CW .
JOURNAL OF ADVANCED TRANSPORTATION, 1997, 31 (01) :75-94
[8]   The dynamic berth allocation problem for a container port [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :401-417
[9]   The simultaneous berth and quay crane allocation problem [J].
Imai, Akio ;
Chen, Hsieh Chia ;
Nishimura, Etsuko ;
Papadimitriou, Stratos .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (05) :900-920
[10]   Berth allocation at indented berths for mega-containerships [J].
Imai, Akio ;
Nishimura, Etsuko ;
Hattori, Masahiro ;
Papadimitriou, Stratos .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) :579-593