期刊文献+

考虑企业配送能力约束的协作配送模型及成本分摊影响研究

Research on Collaborative Distribution Model Considering Distribution Capability Constraints of Enterprises and Its Influence on Cost Allocation
原文传递
导出
摘要 传统协作配送研究假设企业及其组建的任意子联盟配送能力充足,但现实中每个企业的配送能力都是有限的,可能出现配送能力不足的情况。基于此,本文提出先向联盟内部寻找闲置车辆,再向联盟外部租赁车辆的车辆弥补策略,并设计相应的联盟成本量化流程,构建考虑企业配送能力约束的多方协作配送成本量化模型,采用Shapley值法分摊联盟成本。最后,通过数据实验对策略及模型的有效性进行了验证。结果表明,本文所提方法能够客观量化企业配送能力不足时,子联盟所需的协作配送成本。此外,对企业配送能力约束的影响进行了分析,当联盟成员配送能力不足时,其分摊值上升,成本节约量降低;当其他成员有闲置车辆时,投入闲置车辆能使该部分成员获得额外的经济效益。配送企业需合理配置车辆资源,避免因配送能力不足造成的成本节约量损失;同时,平台应当积极引导车辆资源丰富的企业共享运力,以提高联盟内部资源互补程度,提升联盟整体效益。 Delivery vehicles are limited resources in firms with capital-intensive assets,such as distribution enterprises,which must guarantee high availability and revenue returns.Collaboration via resource sharing among distribution enterprises provides an opportunity to effectively increase the efficiency and sustainability of logistics operations.However,the limitation of the available vehicle capacity will possibly lead to the shortage of distribution capacity and even the failure of collaboration in the distribution process.This problem is modelled as an integer programming which minimizes vehicle routing costs,fixed costs,and possible vehicle rental costs for sub-alliances,named the multi-owner collaborative vehicle routing problem model with limited distribution capability.A vehicle make-up strategy is developed for supplementary vehicles.It allows enterprises with insufficient vehicles to first seek available capacity from members with idle vehicles within the alliance.If their capacity is still not met,vehicle-leasing decisions from other distribution companies outside the alliance must be taken,while paying higher rents as result.Through the vehicle make-up strategy,the cost can be accurately quantified with the model and then a fair and reasonable allocation result is obtained.Then,the Shapley value equation is applied to determine the cost to be shared by each member.Our numerical study on a testbed of instances demonstrates the value of vehicle make-up strategy and the benefits of collaboration.The collaborative distribution leads to significant savings for all members,with a cost reduction of 13.34%to 20.84%compared with individual delivery,even when each alliance members lease a higher-cost vehicle,the total cost savings can reach 12.62%to 19.41%.The benefits of first seeking inside the alliance to find idle vehicles,which are rarely discussed in previous articles,are obvious with a reduction of the additional expenses triggered by vehicle shortages.The numerical results demonstrate that it is still profitable for firms to join collaborative distribution even the delivery capacity is insufficient and need to pay higher rents to lease vehicles.Furthermore,collaboration shows to be particularly attractive for enterprises with high facility reserves,obtaining extra awards through additional cost reduction.The research results have important reference value and practical significance for distribution enterprises who adopt collaborative distribution mechanism and corresponding cost allocation with considering the insufficient vehicle capacity.
作者 饶卫振 苗晓河 刘露 Rao Weizhen;Miao Xiaohe;Liu lu(College of Economics&Management,Shandong University of Science and Technology,Qingdao 266590,China)
出处 《中国管理科学》 CSCD 北大核心 2024年第7期106-116,共11页 Chinese Journal of Management Science
基金 泰山学者工程专项经费资助项目(tsqn201909111) 国家自然科学基金青年项目(71902105) 教育部人文社会科学研究规划基金项目(21YGA630075) 山东省高等学校优秀青年创新团队(2019RWG010)。
关键词 协作配送 配送能力约束 成本节约量 SHAPLEY值法 collaborative distribution distribution capacity constraints cost savings Shapley value method
  • 相关文献

参考文献8

二级参考文献60

  • 1侯立文,谭家美,赵元.求解带时间窗的客户需求可分条件下的车辆路径问题[J].中国管理科学,2007,15(6):46-51. 被引量:18
  • 2李德清,李洪兴.变权决策中变权效果分析与状态变权向量的确定[J].控制与决策,2004,19(11):1241-1245. 被引量:66
  • 3钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究[J].运筹学学报,2005,9(4):67-73. 被引量:31
  • 4陈雯,张强.模糊合作对策的Shapley值[J].管理科学学报,2006,9(5):50-55. 被引量:45
  • 5Cornillier F, Boctor F, Renaud J. Heuristics for the multi-depot petrol station replenishment problem with time windows[J]. European Journal of Operational Research, 2012, 220(2): 361-369.
  • 6Aras N, Aksen D, Tekin M T. Selective multi-depot vehicle routing problem with pricing[J]. Transportation Research Part C, 2011, 19(5): 866-884.
  • 7Wasner M, Zapfel G. An integrated multi-depot hub-location vehicle routing model for network planning of parcel service[J]. International Journal of Production Economics, 2004, 90(3): 403-419.
  • 8Nagy G, Salhi S. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[J]. European Journal of Operational Research, 2005, 162(1): 126-141.
  • 9Kuo Y, Wang C C. A variable neighborhood search for the multi-depot vehicle routing problem with loading cost[J]. Expert systems with Application, 2012, 39(8): 6949-6954.
  • 10Mirabi M, Fatemi Ghomi S M T, Jolai F. Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem[J]. Robotics and Computer-Integrated Manufacturing, 2010, 26(6): 564-569.

共引文献103

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部