Core-based cost allocation for collaborative multi-stop truckload shipping problem

被引:1
作者
Lai, Minghui [1 ]
Wu, Yating [1 ]
Cai, Xiaoqiang [2 ,3 ]
机构
[1] Southeast Univ, Sch Econ & Management, Nanjing, Peoples R China
[2] Chinese Univ Hong Kong Shenzhen, Shenzhen, Peoples R China
[3] Inst Big Data, Shenzhen Res, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-stop truckload shipping; collaborative logistics; cooperative game; least-core; column-and-row-generation; TRAVELING SALESMAN; COOPERATIVE GAMES; TRANSPORTATION; OPTIMIZATION; FLEXIBILITY; MECHANISMS; BINPACKING; ALGORITHM; DELIVERY; SERVICE;
D O I
10.1080/24725854.2024.2324358
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
With the recently emerged digital platforms in logistics, shippers can easily collaborate by bundling their heavy less-than-truckload orders via multi-stop truckload shipping to reduce transportation cost. The platform has responsibility for planning the shipping routes, for bundling the orders and fairly allocating the cost to shippers. To address this challenging problem in practice, we propose a new cooperative game based on a variant of a pickup and delivery model with soft time windows for shipper collaboration. The centralized optimization model is NP-hard and the core of the game may be empty. We adopt the least-core concept and simplify the core stability constraints as route-wise conditions. Based on theoretical results, we propose an innovative route-generation joint searching algorithm that iteratively solves the centralized optimization and least-core allocation problems at the same time, where the route-generation subproblem is solved by a customized multi-start local search subroutine. Extensive computational experiments on a real-world case demonstrate that the proposed algorithm can quickly generate a near-optimal solution with minor optimality gap and a least-core allocation with small stability deviation. With our algorithm, the shippers also receive substantial cost savings from collaboration.
引用
收藏
页码:938 / 956
页数:19
相关论文
共 79 条
[1]   Systematic literature review on collaborative sustainable transportation: overview, analysis and perspectives [J].
Aloui, Aymen ;
Hamani, Nadia ;
Derrouiche, Ridha ;
Delahoche, Laurent .
TRANSPORTATION RESEARCH INTERDISCIPLINARY PERSPECTIVES, 2021, 9
[2]   Cost allocation mechanisms in a peer-to-peer network [J].
Altan, Basak ;
Ozener, Okan Orsan .
NETWORKS, 2019, 73 (01) :104-118
[3]  
Amap, 2022, ROUTE PLANNING API D
[4]  
[Anonymous], 2021, NETWORK DESIGN APPL, P627, DOI DOI 10.1007/978-3-030-64018-7_20
[5]   The open vehicle routing problem with decoupling points [J].
Atefi, Reza ;
Salari, Majid ;
Coelho, Leandro C. ;
Renaud, Jacques .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (01) :316-327
[6]   A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics [J].
Basso, Franco ;
D'Amours, Sophie ;
Ronnqvist, Mikael ;
Weintraub, Andres .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (03) :775-793
[7]  
Belien J., 2017, ORMS TODAY, V44, P20
[8]   One-way and two-way cost allocation in hub network problems [J].
Bergantinos, G. ;
Vidal-Puga, J. .
OR SPECTRUM, 2020, 42 (01) :199-234
[9]   Computing solutions for matching games [J].
Biro, Peter ;
Kern, Walter ;
Paulusma, Daniel .
INTERNATIONAL JOURNAL OF GAME THEORY, 2012, 41 (01) :75-90
[10]   A column-generation approach to line planning in public transport [J].
Borndoerfer, Ralf ;
Groetschel, Martin ;
Pfetsch, Marc E. .
TRANSPORTATION SCIENCE, 2007, 41 (01) :123-132