清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
合不着完成签到 ,获得积分10
7秒前
计划完成签到,获得积分10
38秒前
Criminology34应助归海浩阑采纳,获得10
1分钟前
慕青应助科研通管家采纳,获得10
1分钟前
GPTea应助科研通管家采纳,获得10
1分钟前
1分钟前
可言完成签到,获得积分10
1分钟前
1分钟前
1分钟前
外向的妍完成签到,获得积分10
2分钟前
2分钟前
Tales完成签到 ,获得积分10
2分钟前
常有李完成签到,获得积分10
2分钟前
2分钟前
袁慧凡发布了新的文献求助30
2分钟前
2分钟前
2分钟前
3分钟前
科研通AI5应助科研通管家采纳,获得10
3分钟前
胖哥发布了新的文献求助10
3分钟前
3分钟前
激动的似狮完成签到,获得积分10
3分钟前
3分钟前
3分钟前
英俊的铭应助秦路采纳,获得10
3分钟前
MchemG完成签到,获得积分0
3分钟前
3分钟前
正己化人应助FEOROCHA采纳,获得10
3分钟前
秦路发布了新的文献求助10
3分钟前
3分钟前
3分钟前
shining1发布了新的文献求助10
4分钟前
shining1完成签到,获得积分10
4分钟前
灿烂而孤独的八戒完成签到 ,获得积分0
4分钟前
Akim应助科研通管家采纳,获得30
5分钟前
GPTea应助科研通管家采纳,获得50
5分钟前
GPTea应助科研通管家采纳,获得50
5分钟前
欣欣完成签到 ,获得积分10
5分钟前
GPTea应助科研通管家采纳,获得50
7分钟前
GPTea应助科研通管家采纳,获得50
7分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Pipeline and riser loss of containment 2001 - 2020 (PARLOC 2020) 1000
The Social Work Ethics Casebook: Cases and Commentary (revised 2nd ed.).. Frederic G. Reamer 600
Extreme ultraviolet pellicle cooling by hydrogen gas flow (Conference Presentation) 500
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 500
A Manual for the Identification of Plant Seeds and Fruits : Second revised edition 500
Lloyd's Register of Shipping's Approach to the Control of Incidents of Brittle Fracture in Ship Structures 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 5174213
求助须知:如何正确求助?哪些是违规求助? 4363783
关于积分的说明 13585886
捐赠科研通 4212454
什么是DOI,文献DOI怎么找? 2310523
邀请新用户注册赠送积分活动 1309542
关于科研通互助平台的介绍 1257188