Container slot allocation policy in vessel pool alliance under stochastic demand

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Jinpeng Liang, Yuhang Zhou, Shuang Wang, Jianfeng Zheng
{"title":"Container slot allocation policy in vessel pool alliance under stochastic demand","authors":"Jinpeng Liang,&nbsp;Yuhang Zhou,&nbsp;Shuang Wang,&nbsp;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.
随机需求下船池联盟集装箱舱位分配策略
船池联盟是班轮航运业中一种比较突出的合作模式,由联合经营人共同管理联盟成员的集体运力。在具有随机需求的货物间有效分配集装箱舱位是联盟管理者面临的主要挑战。本研究通过将其表述为一个随机线性规划模型来解决这个复杂的问题,该模型旨在最大化联盟的总货运收入,同时确保每个成员运营商都有足够的收入,从而保持联盟的长期稳定。为了解决这个问题,我们首先采用一种增强的深度优先搜索算法来为每种货物确定一组可行的运输路径。随后,我们制定了一个有效的策略来确定每个实现需求场景的最佳时段分配。采用合成数据和实际数据进行的数值实验表明,我们提出的策略明显优于目前实践中流行的集装箱槽位交换联盟和独立运营模式。通过优化机位资源的利用率,我们的方法显著提高了联盟整体和单个成员运营商的收入。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信