{"title":"Container slot allocation policy in vessel pool alliance under stochastic demand","authors":"Jinpeng Liang, Yuhang Zhou, Shuang Wang, Jianfeng Zheng","doi":"10.1016/j.cor.2025.107074","DOIUrl":null,"url":null,"abstract":"<div><div>The vessel pool alliance is a prominent cooperation model within the liner shipping industry, where a joint operator manages the collective shipping capacities of all alliance members. The primary challenge for the alliance manager is the efficient allocation of container slots among cargoes with stochastic demand. This study addresses this complex problem by formulating it as a stochastic linear programming model aimed at maximizing the alliance’s total freight revenue while simultaneously ensuring adequate revenue for each member operator, thereby maintaining long-term alliance stability. To solve this problem, we first employ an enhanced Depth-First Search algorithm to identify a set of feasible transportation paths for each cargo. Subsequently, we develop an efficient policy to determine the optimal slot allocation for each realized demand scenario. Numerical experiments using both synthetic and real-world data demonstrate that our proposed policy significantly outperforms the container slot exchange alliance and independent operation modes currently prevalent in practice. Our approach notably enhances revenues for both the alliance as a whole and individual member operators by optimizing the utilization of slot resources.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"180 ","pages":"Article 107074"},"PeriodicalIF":4.1000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825001029","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
The vessel pool alliance is a prominent cooperation model within the liner shipping industry, where a joint operator manages the collective shipping capacities of all alliance members. The primary challenge for the alliance manager is the efficient allocation of container slots among cargoes with stochastic demand. This study addresses this complex problem by formulating it as a stochastic linear programming model aimed at maximizing the alliance’s total freight revenue while simultaneously ensuring adequate revenue for each member operator, thereby maintaining long-term alliance stability. To solve this problem, we first employ an enhanced Depth-First Search algorithm to identify a set of feasible transportation paths for each cargo. Subsequently, we develop an efficient policy to determine the optimal slot allocation for each realized demand scenario. Numerical experiments using both synthetic and real-world data demonstrate that our proposed policy significantly outperforms the container slot exchange alliance and independent operation modes currently prevalent in practice. Our approach notably enhances revenues for both the alliance as a whole and individual member operators by optimizing the utilization of slot resources.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.