TY - JOUR
T1 - Integrated optimization of vessel dispatching and empty container repositioning considering turnover time uncertainty
AU - Xiang, Xi
AU - Wang, Zihao
AU - Gong, Lin
AU - Jia, Shuai
AU - Liu, Xin
AU - Liu, Minxia
N1 - Publisher Copyright:
© 2024
PY - 2024/11
Y1 - 2024/11
N2 - The global trade disproportion results in the accumulation of containers in import-dominated ports and shortages in export-dominated ports, causing congestion and high freight costs, thus hindering maritime shipping economy development. To address these issues, this study develops a stochastic programming model considering uncertain container turnover times. The model integrates decisions for vessel deployment and empty container repositioning over multiple planning periods through a two-stage decision process, aiming to minimize the total cost, including vessel deployment, container leasing, and penalty costs for unfulfilled demand. By formulating the scenario selection problem as a p-median problem, we effectively reduce the model size. We propose an accelerated Benders decomposition algorithm which leverages the independence of sub-problems in the second stage to enable parallel computation. Numerical experiments show that our Benders decomposition algorithm improves solution speed by over 63% compared to the Gurobi optimization solver. Furthermore, our integrated optimization approach proves to be more cost-effective than the reactive method used by shipping lines, achieving an average cost savings of 0.72%. Additionally, our method of constructing turnover time scenarios to address uncertainty saves approximately 0.45% in costs compared to using the probability distribution of container turnover time.
AB - The global trade disproportion results in the accumulation of containers in import-dominated ports and shortages in export-dominated ports, causing congestion and high freight costs, thus hindering maritime shipping economy development. To address these issues, this study develops a stochastic programming model considering uncertain container turnover times. The model integrates decisions for vessel deployment and empty container repositioning over multiple planning periods through a two-stage decision process, aiming to minimize the total cost, including vessel deployment, container leasing, and penalty costs for unfulfilled demand. By formulating the scenario selection problem as a p-median problem, we effectively reduce the model size. We propose an accelerated Benders decomposition algorithm which leverages the independence of sub-problems in the second stage to enable parallel computation. Numerical experiments show that our Benders decomposition algorithm improves solution speed by over 63% compared to the Gurobi optimization solver. Furthermore, our integrated optimization approach proves to be more cost-effective than the reactive method used by shipping lines, achieving an average cost savings of 0.72%. Additionally, our method of constructing turnover time scenarios to address uncertainty saves approximately 0.45% in costs compared to using the probability distribution of container turnover time.
KW - Benders decomposition
KW - Empty container repositioning
KW - Maritime shipping
KW - Stochastic programming
KW - Vessel deployment
UR - http://www.scopus.com/inward/record.url?scp=85204464832&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2024.110566
DO - 10.1016/j.cie.2024.110566
M3 - Article
AN - SCOPUS:85204464832
SN - 0360-8352
VL - 197
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
M1 - 110566
ER -