Cost Allocation for Less-Than-Truckload Collaboration via Shipper Consortium

启发式 运筹学 成本分摊 联营 流量网络 总成本 计算机科学 数学优化 预算约束 经济 微观经济学 工程类 数学 会计 人工智能
作者
Minghui Lai,Xiaoqiang Cai,Nicholas G. Hall
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:56 (3): 585-611 被引量:11
标识
DOI:10.1287/trsc.2021.1066
摘要

We study the problem of collaborative less-than-truckload (LTL) transportation in the form of a shipper consortium, which is operated by a third-party logistics provider (3PL) through a cross-dock/pooling network. The 3PL has responsibility for planning the combined loads prior to actual shipments, hiring and routing carriers to execute shipping, and allocating the cost to the shippers in the consortium. Shippers receive substantial cost savings from combined truckload shipments. However, achieving consolidation and realizing this benefit requires addressing two essential issues: (i) how to find an approximately optimal consolidation solution in a large network with many freights and (ii) how to determine a fair cost allocation rule among the shippers’ consolidated freights that ensures budget balance while minimally violating coalitional stability. Our work resolves these two issues. We formulate a time-space network flow model of the problem under both incremental and all-unit discount structures of LTL rates and propose a computationally efficient algorithm based on local search heuristics. We model the problem of allocating cost to the shippers as a cooperative game. We decompose and linearize the Lagrangian dual problem by using total unimodularity and concavity. We propose an efficiently computable cost allocation rule from the linearized dual models. The dual rule ensures stable cooperation but may have underallocation equal to a duality gap. To cover the underallocation, we further develop a budget covering procedure and define an [Formula: see text]-core allocation with desirable properties. Through extensive computational experiments, we find that the shipper consortium reduces total shipping costs by more than 40% in most cases; meanwhile, the [Formula: see text]-core allocation is typically in the core for small-scale networks while violating stability by at most 5% for large-scale networks and provides consolidated freights with more than 50% individual cost savings on average.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
LINDENG2004完成签到 ,获得积分10
3秒前
wz完成签到,获得积分10
4秒前
简奥斯汀完成签到 ,获得积分10
11秒前
五本笔记完成签到 ,获得积分10
11秒前
14秒前
花花发布了新的文献求助20
14秒前
asd113发布了新的文献求助10
18秒前
美满的小蘑菇完成签到 ,获得积分10
18秒前
自然白安完成签到 ,获得积分10
24秒前
量子星尘发布了新的文献求助10
27秒前
等待小鸽子完成签到 ,获得积分10
29秒前
龙虾发票完成签到,获得积分10
36秒前
小康学弟完成签到 ,获得积分10
36秒前
了0完成签到 ,获得积分10
36秒前
慕青应助科研通管家采纳,获得10
39秒前
彭于晏应助科研通管家采纳,获得30
39秒前
毛豆爸爸应助科研通管家采纳,获得20
39秒前
林利芳完成签到 ,获得积分0
40秒前
JaneChen完成签到 ,获得积分10
42秒前
健壮惋清完成签到 ,获得积分10
42秒前
43秒前
gabee完成签到 ,获得积分10
47秒前
liang19640908完成签到 ,获得积分10
50秒前
奋斗的雪曼完成签到 ,获得积分10
56秒前
粗心的飞槐完成签到 ,获得积分10
56秒前
LELE完成签到 ,获得积分10
1分钟前
了0完成签到 ,获得积分10
1分钟前
apocalypse完成签到 ,获得积分10
1分钟前
guhao完成签到 ,获得积分10
1分钟前
指导灰完成签到 ,获得积分10
1分钟前
善良的火完成签到 ,获得积分10
1分钟前
优雅夕阳完成签到 ,获得积分10
1分钟前
Jasper应助光亮的自行车采纳,获得10
1分钟前
miki完成签到,获得积分10
1分钟前
量子星尘发布了新的文献求助10
1分钟前
糖宝完成签到 ,获得积分10
1分钟前
KX2024完成签到,获得积分10
1分钟前
松松发布了新的文献求助20
1分钟前
nusiew完成签到,获得积分10
1分钟前
huiluowork完成签到 ,获得积分10
1分钟前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038066
求助须知:如何正确求助?哪些是违规求助? 3575779
关于积分的说明 11373801
捐赠科研通 3305584
什么是DOI,文献DOI怎么找? 1819239
邀请新用户注册赠送积分活动 892655
科研通“疑难数据库(出版商)”最低求助积分说明 815022