The designation of berths, the service strategy for vessels and the assignment of cranes are important for improving the operational efficiency of container terminals. The berth may be discrete or continuous, we focus on the continuous situation. In this paper we first establish an evaluation index system for describing continuous berth allocation, service strategy for vessels and assignment of cranes. We then design Monte Carlo method to simulate different scenarios of operation and calculate various performance indices. The data is analyzed by variance and sensitivity analysis. We finally use the index values to design reasonable operation schedules for integrating berth allocation and crane assignment.
BierwirthCMeiselF. A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Operat Res2010; 202(3): 615–627.
8.
ChenJHLeeD-HCaoJX. Heuristics for quay crane scheduling at indented berth. Transport Res E2011; 47: 1005–1020.
9.
LaiKKShihK. A study of container berth allocation. J Adv Transport1992; 26: 45–60.
10.
LimA. The berth planning problem. Operat Res Lett1998; 22(223): 105–110.
11.
ImaiANagaiwaKCatCW. Efficient planning of berth allocation for container terminals in Asia. J Adv Transport1997; 31(1): 75–94.
12.
ImaiANishimuraEPapadimitriouS. The dynamic berth allocation problem for a container port. Transport Res B2001; 35: 401–417.
13.
ImaiAChenHCNishimuraE. The simultaneous berth and quay crane allocation problem. Transport Res E2008; 44(5): 900–920.
14.
NishimuraEImaiAPapadimitriouS. Berth allocation planning in the public berth system by genetic algorithms. Eur J Operat Res2001; 131(2): 282–292.
15.
XuDSLiCLJosephY-TL. Berth allocation with time-dependent physical limitations on vessels. Eur J Operat Res2011; 216: 47–56.
16.
GuanYXiaoWQChengRKLiCL. A multiprocessor task scheduling model for berth allocation heuristic and worst-case analysis. Operat Res Lett2002; 30: 343–350.
17.
AkioISunXNishimuraEPapadimitriouS. Berth allocation in a container port: using a continuous location space approach. Transport Res B2005; 39: 199–221.
18.
ZhangYWangSM. Research of dynamic berth allocation of continuous case based on GA. J Syst Sim2007; 19: 2161–2164.
19.
LeeDHChenJHCaoJX. The continuous berth allocation problem: a greedy randomized adaptive search solution. Transport Res E2010; 46: 1017–1029.
20.
LeeYChenCY. An optimization heuristic for the berth scheduling problem. Eur J Operat Res2008; 196(2): 500–508.
21.
DaganzoCF. The crane scheduling problem. Transport Res B1989; 23(3): 159–175.
22.
PeterkofskyRIDaganzoCF. A branch and bound solution method for the crane scheduling problem. Transport Res B1990; 24(3): 159–172.
23.
ParkYMKimKH. A scheduling method for berth and quay cranes. OR Spectrum2003; 25(1): 12–23.
24.
ZhouPKangHLinL. A dynamic berth allocation model based on stochastic consideration. In Proceedings of the Sixth World Congress on Intelligent Control and Automation, 2006, pp. 7297–7301.
25.
MeiselFBierwirthC. Heuristics for the integration of crane productivity in the berth allocation problem. Transport Res E2009; 45: 196–209.
26.
LiangCHuangYYangY. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput Indust Eng2009; 56(3): 1021–1028.
27.
ChangDFJiangZHYanWHeJL. Integrating berth allocation and quay crane assignments. Transport Res E2010; 46: 975–990.
28.
SongLYCherrettTGuanW. Study on berth planning problem in a container seaport: using an integrated programming approach. Comput Indust Eng2011; 62: 119–128.
29.
JahangirianMEldabiTNaseerAStergioulasLKYoungT. Simulation in manufacturing and business: A review. Eur J Operat Res2010; 203(1): 1–13.
30.
PasqualeLRinaM. Berth planning and resources optimisation at a container terminal via discrete event simulation. Eur J Operat Res2000; 133: 537–547.
31.
HanXLLuZQXiLF. A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur J Operat Res2010; 207: 1327–1340.
32.
TingCJWuKCChouH. Particle swarm optimization algorithm for the berth allocation problem. Expert Syst Applic2014; 41(4): 1543–1550.
33.
Lalla-RuizEGonzález-VelardeJLMelián-BatistaBMoreno-VegaJM. Biased random key genetic algorithm for the tactical berth allocation problem. Appl Soft Comput2014; 22: 60–76.
34.
ElwanyHAliIAbouelseoudY. A heuristics-based solution to the continuous berth allocation and crane assignment problem. Alexandria Eng J2013; 52: 671–677.
35.
RodrigueJ-PComtoisCSlackB. The Geography of Transport Systems, 3rd edn. New York: Routledge, 2013.
