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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
苏航发布了新的文献求助10
1秒前
2秒前
风中无血发布了新的文献求助10
6秒前
昏睡的绍辉完成签到,获得积分10
8秒前
9秒前
搜集达人应助daxiong采纳,获得10
12秒前
量子星尘发布了新的文献求助10
13秒前
13秒前
乐乐应助哼哼唧唧采纳,获得10
15秒前
风中无血完成签到,获得积分10
16秒前
zeng发布了新的文献求助10
23秒前
25秒前
苏航完成签到,获得积分20
25秒前
27秒前
FashionBoy应助伪装的鱼采纳,获得10
27秒前
27秒前
daxiong发布了新的文献求助10
29秒前
阿Q完成签到,获得积分10
29秒前
31秒前
31秒前
nczpf2010发布了新的文献求助10
32秒前
yufanhui应助包容剑鬼采纳,获得10
34秒前
肉肉发布了新的文献求助20
34秒前
Li完成签到 ,获得积分10
35秒前
36秒前
乔乔兔发布了新的文献求助10
36秒前
哼哼唧唧发布了新的文献求助10
37秒前
Hello应助田田采纳,获得10
38秒前
喜悦松完成签到,获得积分10
39秒前
完美世界应助伪装的鱼采纳,获得10
39秒前
调皮初蝶发布了新的文献求助10
40秒前
41秒前
beituo完成签到,获得积分10
41秒前
41秒前
bkagyin应助从容的戎采纳,获得10
42秒前
轻松的亦寒应助辻辰采纳,获得20
43秒前
44秒前
一颗大树完成签到,获得积分10
44秒前
万能图书馆应助Clr采纳,获得30
44秒前
ff发布了新的文献求助10
47秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 700
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3975378
求助须知:如何正确求助?哪些是违规求助? 3519775
关于积分的说明 11199621
捐赠科研通 3256067
什么是DOI,文献DOI怎么找? 1798124
邀请新用户注册赠送积分活动 877386
科研通“疑难数据库(出版商)”最低求助积分说明 806305