TY - JOUR
T1 - A simulation optimization method for deep-sea vessel berth planning and feeder arrival scheduling at a container port
AU - Jia, Shuai
AU - Li, Chung Lun
AU - Xu, Zhou
N1 - Funding Information:
The authors thank Professor Jeff L. Hong and four anonymous referees for their valuable comments that improved the paper. This work was done when the first author was a Ph.D. student at the Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University. The first author is supported by the National Natural Science Foundation of China (Grant no. 72001146). The third author is supported by the Research Grants Council of the HKSAR, China (Grant no. PolyU 152186/14E).
Funding Information:
The authors thank Professor Jeff L. Hong and four anonymous referees for their valuable comments that improved the paper. This work was done when the first author was a Ph.D. student at the Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University. The first author is supported by the National Natural Science Foundation of China (Grant no. 72001146). The third author is supported by the Research Grants Council of the HKSAR, China (Grant no. PolyU 152186/14E).
Publisher Copyright:
© 2020 Elsevier Ltd
PY - 2020/12
Y1 - 2020/12
N2 - Vessels served by a container port can usually be classified into two types: deep-sea vessels and feeders. While the arrival times and service times of deep-sea vessels are known to the port operator when berth plans are being devised, the service times of feeders are usually uncertain due to lack of data interchange between the port operator and the feeder operators. The uncertainty of feeder service times can incur long waiting lines and severe port congestion if the service plans for deep-sea vessels and feeders are poorly devised. This paper studies the problem of how to allocate berths to deep-sea vessels and schedule arrivals of feeders for congestion mitigation at a container port where the number of feeders to be served is significantly larger than the number of deep-sea vessels, and where the service times of feeders are uncertain. We develop a stochastic optimization model that determines the berth plans of deep-sea vessels and arrival schedules of feeders, so as to minimize the departure delays of deep-sea vessels and schedule displacements of feeders. The model controls port congestion through restricting the expected queue length of feeders. We develop a three-phase simulation optimization method to solve this problem. Our method comprises a global phase, a local phase, and a clean-up phase, where the simulation budget is wisely allocated to the solutions explored in different phases so that a locally optimal solution can be identified with a reasonable amount of computation effort. We evaluate the performance of the simulation optimization method using test instances generated based on the operational data of a container port in Shanghai.
AB - Vessels served by a container port can usually be classified into two types: deep-sea vessels and feeders. While the arrival times and service times of deep-sea vessels are known to the port operator when berth plans are being devised, the service times of feeders are usually uncertain due to lack of data interchange between the port operator and the feeder operators. The uncertainty of feeder service times can incur long waiting lines and severe port congestion if the service plans for deep-sea vessels and feeders are poorly devised. This paper studies the problem of how to allocate berths to deep-sea vessels and schedule arrivals of feeders for congestion mitigation at a container port where the number of feeders to be served is significantly larger than the number of deep-sea vessels, and where the service times of feeders are uncertain. We develop a stochastic optimization model that determines the berth plans of deep-sea vessels and arrival schedules of feeders, so as to minimize the departure delays of deep-sea vessels and schedule displacements of feeders. The model controls port congestion through restricting the expected queue length of feeders. We develop a three-phase simulation optimization method to solve this problem. Our method comprises a global phase, a local phase, and a clean-up phase, where the simulation budget is wisely allocated to the solutions explored in different phases so that a locally optimal solution can be identified with a reasonable amount of computation effort. We evaluate the performance of the simulation optimization method using test instances generated based on the operational data of a container port in Shanghai.
KW - Berth allocation
KW - Congestion mitigation
KW - Port operations
KW - Service time uncertainty
KW - Simulation optimization
UR - http://www.scopus.com/inward/record.url?scp=85095455560&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2020.10.007
DO - 10.1016/j.trb.2020.10.007
M3 - Journal article
AN - SCOPUS:85095455560
SN - 0191-2615
VL - 142
SP - 174
EP - 196
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
ER -