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
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
tracy发布了新的文献求助10
1秒前
2秒前
3秒前
5秒前
5秒前
嘉嘉完成签到,获得积分20
5秒前
6秒前
感谢发布了新的文献求助10
6秒前
liying发布了新的文献求助10
7秒前
sci2025opt完成签到 ,获得积分10
7秒前
7秒前
7秒前
叁叁肆发布了新的文献求助10
8秒前
充电宝应助义气的衬衫采纳,获得10
9秒前
科研通AI6应助茶米采纳,获得10
9秒前
英俊雪曼发布了新的文献求助10
9秒前
谨慎盼山发布了新的文献求助10
10秒前
10秒前
科研通AI6应助科研小白采纳,获得10
10秒前
year发布了新的文献求助10
11秒前
金小爬小金完成签到,获得积分20
11秒前
gyt完成签到,获得积分10
12秒前
小葱头发布了新的文献求助100
12秒前
12秒前
LJJ发布了新的文献求助10
13秒前
英俊的铭应助czf采纳,获得10
14秒前
shijie应助谨慎盼山采纳,获得10
15秒前
深情安青应助gyt采纳,获得10
16秒前
深情安青应助111采纳,获得10
16秒前
17秒前
爆米花应助嘉嘉采纳,获得10
17秒前
Ethel发布了新的文献求助10
17秒前
18秒前
zxswuyin完成签到,获得积分10
19秒前
19秒前
Akim应助Walker采纳,获得10
20秒前
狂野的厉发布了新的文献求助10
20秒前
liying完成签到,获得积分20
21秒前
AllIN发布了新的文献求助10
21秒前
nen完成签到 ,获得积分10
21秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
List of 1,091 Public Pension Profiles by Region 1601
Lloyd's Register of Shipping's Approach to the Control of Incidents of Brittle Fracture in Ship Structures 800
Biology of the Reptilia. Volume 21. Morphology I. The Skull and Appendicular Locomotor Apparatus of Lepidosauria 620
A Guide to Genetic Counseling, 3rd Edition 500
Laryngeal Mask Anesthesia: Principles and Practice. 2nd ed 500
The Composition and Relative Chronology of Dynasties 16 and 17 in Egypt 500
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5557467
求助须知:如何正确求助?哪些是违规求助? 4642491
关于积分的说明 14668341
捐赠科研通 4583911
什么是DOI,文献DOI怎么找? 2514433
邀请新用户注册赠送积分活动 1488818
关于科研通互助平台的介绍 1459439