TY - JOUR
T1 - A two-stage stochastic nonlinear integer-programming model for slot allocation of a liner container shipping service
AU - Wang, Tingsong
AU - Meng, Qiang
AU - Wang, Shuaian
AU - Qu, Xiaobo
N1 - Funding Information:
We are grateful to the associate editor and two anonymous reviewers for their valuable comments and suggestions made for the previous versions of this study. This research is supported by the National Natural Science and Foundation of China [No. 71771180, No. 71831002, No. 71771050, and No. 71831008], and Humanities and Social Science Foundation of Ministry of Education of China (No. 16YJC630112 ). The second authors would like to appreciate the support from the research project “Container Haulage Problems: Model Development, Effective Algorithm Design and Applications” (R-302-000-226-720) funded by NOL Fellowship Programme for this study.
Publisher Copyright:
© 2021 Elsevier Ltd
PY - 2021/8
Y1 - 2021/8
N2 - In this study, we propose a container slot allocation problem for a liner shipping service. A liner containership provides a regular shipping service with a fixed itinerary and schedule. In practice, the liner containership may not be fully loaded, which results in a loss of revenue. We therefore segment shippers into two classes: contract shippers and spot shippers. A contract shipper has a contract with the shipping company and negotiates a fixed minimum quantity, so that the shipping company can secure a steady revenue. The remaining containership slots are open to spot shippers, allowing the shipping company to obtain ad hoc revenue. The container slot allocation problem is investigated in this study using a two-stage stochastic mixed-integer nonlinear programming model. We use the sample average approximation based on Lagrangian relaxation and dual decomposition techniques to effectively solve the model. Finally, we conduct a case study to evaluate the applicability and effectiveness of the proposed model and the solution algorithm.
AB - In this study, we propose a container slot allocation problem for a liner shipping service. A liner containership provides a regular shipping service with a fixed itinerary and schedule. In practice, the liner containership may not be fully loaded, which results in a loss of revenue. We therefore segment shippers into two classes: contract shippers and spot shippers. A contract shipper has a contract with the shipping company and negotiates a fixed minimum quantity, so that the shipping company can secure a steady revenue. The remaining containership slots are open to spot shippers, allowing the shipping company to obtain ad hoc revenue. The container slot allocation problem is investigated in this study using a two-stage stochastic mixed-integer nonlinear programming model. We use the sample average approximation based on Lagrangian relaxation and dual decomposition techniques to effectively solve the model. Finally, we conduct a case study to evaluate the applicability and effectiveness of the proposed model and the solution algorithm.
KW - Container slot allocation
KW - Lagrangian relaxation and dual decomposition
KW - Sample average approximation
KW - Two-stage stochastic mixed-integer nonlinear programming
UR - http://www.scopus.com/inward/record.url?scp=85108285367&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2021.04.016
DO - 10.1016/j.trb.2021.04.016
M3 - Journal article
AN - SCOPUS:85108285367
SN - 0191-2615
VL - 150
SP - 143
EP - 160
JO - Transportation Research Part B: Methodological
JF - Transportation Research Part B: Methodological
ER -