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 被引量:14
标识
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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
会玩手机的猫完成签到,获得积分10
1秒前
一路硕博发布了新的文献求助20
1秒前
1秒前
Broxiga发布了新的文献求助10
1秒前
2秒前
呜呜呜完成签到,获得积分10
2秒前
善学以致用应助霍嘉文采纳,获得10
2秒前
2秒前
2秒前
尼古丁_真完成签到,获得积分10
3秒前
情怀应助港岛妹妹采纳,获得10
3秒前
3秒前
Y.J发布了新的文献求助10
4秒前
yyy发布了新的文献求助20
4秒前
Margarate完成签到,获得积分10
5秒前
xxxx完成签到,获得积分10
5秒前
万能图书馆应助bei采纳,获得10
5秒前
wlqc完成签到,获得积分10
5秒前
Shark完成签到,获得积分20
6秒前
小米粥发布了新的文献求助10
6秒前
今晚月色真美完成签到,获得积分10
6秒前
watercolding完成签到,获得积分10
6秒前
悦耳羽毛完成签到,获得积分10
6秒前
6秒前
阔达老太发布了新的文献求助10
7秒前
7秒前
FceEar完成签到,获得积分10
7秒前
7秒前
8秒前
8秒前
8秒前
8秒前
打打应助12545采纳,获得10
8秒前
尹雪儿发布了新的文献求助10
8秒前
甜甜完成签到,获得积分10
9秒前
9秒前
呜呜呜发布了新的文献求助10
9秒前
静飞完成签到 ,获得积分10
10秒前
10秒前
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Kinesiophobia : a new view of chronic pain behavior 3000
The Social Psychology of Citizenship 1000
Signals, Systems, and Signal Processing 510
Discrete-Time Signals and Systems 510
Le genre Cuphophyllus (Donk) st. nov 500
Brittle Fracture in Welded Ships 500
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5930795
求助须知:如何正确求助?哪些是违规求助? 6989531
关于积分的说明 15846511
捐赠科研通 5059476
什么是DOI,文献DOI怎么找? 2721571
邀请新用户注册赠送积分活动 1678488
关于科研通互助平台的介绍 1609988