期刊文献+

基于众包捎带协作的协同配送优化研究 被引量:1

Research on Collaborative Delivery Optimization Based on Crowdsourcing and Piggyback Collaboration
下载PDF
导出
摘要 基于共享经济环境下众包车辆的时空分布性,研究利用众包车辆顺路捎带开展协作的协同配送优化问题。考虑众包车辆时间、空间、能力等个体差异,提出支持众包车辆多任务捎带的协同配送模型。基于问题特征,设计融合多样性初始种群构造算法和基于变邻域搜索算法的混合分散搜索算法求解。仿真实验表明,提出协同配送模型能够有效降低配送成本,设计的改进分散搜索算法寻优性能可靠。 For the past years,the prosperity of commerce,especially the rapid development of e-commerce,has led to a surge delivery demand both in urban and rural areas.With the popularity of e-commerce and the spatial locations of customers,the delivery demands among regions are extremely unbalanced.In addition,with the characteristics of small batch,high frequency and personalized demand,logistics service providers are faced with great challenges in operation cost and customers’satisfaction when independently carrying out delivery services.Effective integration of logistics resources to innovate and intensify delivery models is a crucial measure to improve operational efficiency and reduce operational costs.Based on the temporal and spatial distribution of crowdsourcing vehicles in the sharing economy environment,this paper proposes a collaborative delivery optimization research based on the crowdsourcing vehicle piggyback cooperation.This problem can be defined as the traveling salesman problem with time window under crowdsourcing piggyback collaboration.The problem is described as follows:There are two types of vehicles in the system,basic vehicle and available crowdsourcing vehicles.All customers have time windows,which are traversed by both basic vehicles and crowdsourcing vehicles.Basic vehicles start from the depot,visit customers in turn,transport the requests that need to be collaborated to the designated transfer points,and return to the depot after completing the delivery task.The selected crowdsourcing vehicles start from the starting point as piggy-back vehicles,receive one or more requests to be piggy-back at the transfer points,complete the delivery in turn,and return to the destination.The innovation of this problem is in the following three aspects:(i)There are differences in the capacity of crowdsourcing vehicles;(ii)The requests need to be transferred from basic vehicle to crowdsourcing vehicles at the transfer points;(iii)Each crowdsourcing vehicle can fulfill multiple delivery requests.In order to solve the problem effectively,a hybrid scatter search algorithm based on variable neighborhood search is designed according to the characteristics of the problem.In order to construct high quality initial solutions,a two-phase heuristic algorithm of“High quality seed solution followed by diversified population”is proposed to generate high quality initial population.For the construction of seed solution,a three-stage algorithm of“basic vehicle route-basic vehicle route optimization-cooperative delivery routes”is designed,and then several random construction operators are applied to the construction of diversified initial population based on the seed solution.In addition,to improve the efficiency of the algorithm,a progressive usage strategy of neighborhood structure based on variable probability is designed.The comparison between the constructed TSPTW-CSC instances and the TSPTW benchmark instances shows that the crowdsourcing multi-tasking collaboration can significantly reduce the operation cost,with a maximum cost saving of 23.9%.Meanwhile,the effect of collaboration is significantly affected by piggyback compensation cost.The selection of crowdsourcing vehicles with low operating cost can help contribute better piggyback collaboration.The comparison of algorithms under different algorithm components shows that the proposed two-stage population construction strategy of“high quality seed solution followed by diversified population”and the progressive neighborhood structure usage strategy based on variable probability can improve the solving quality of the algorithm and significantly improve the convergence speed.
作者 周林 陈燕萍 李海燕 朱芳彬 ZHOU Lin;CHEN Yanping;LI Haiyan;ZHU Fangbin(School of Management,Chongqing University of Technology,Chongqing 400054,China)
出处 《运筹与管理》 CSCD 北大核心 2023年第7期78-84,共7页 Operations Research and Management Science
基金 国家自然科学基金青年项目(71801025) 重庆市教委科学技术研究项目(KJQN202201101) 中国物流学会、中国物流与采购联合会面上研究课题(2022CSLKT3-181) 重庆市科委技术创新与应用发展专项重点项目(CSTB2022T1AD-KPX0061) 重庆市自然科学基金项目(cstc2018jcyjAX0021)。
关键词 共享经济 众包配送 车辆协作 分散搜索 sharing economy crowd-delivery vehicle coordination scatter search
  • 相关文献

参考文献6

二级参考文献37

  • 1张军,唐加福,潘震东,孔媛.分散搜索算法求解带货物权重的车辆路径问题[J].系统工程学报,2010,25(1):91-97. 被引量:11
  • 2刘兴,贺国光,高文伟.一种有时间约束的多车辆协作路径模型及算法[J].系统工程,2005,23(4):105-109. 被引量:15
  • 3Moshe Dror.Modeling vehicle.routing with uncertain demands as a stochastic program:Properties fo the corresponding solution[J].European Journal of operational Research.North-holland,1993,64:432-441.
  • 4Alan Laurence Erera.Design of Large-Scale Logistics Systems for Uncertain Environments[D].California:University of colifomia,Berkeley,2000.
  • 5Daganzo CF,Erera AL.On planning and design of logistics systems for uncertain environments,Lecture Notes in Economics and Mathematical Systems[R].Springer-Verlas,Berlin,1999,480:3-21.
  • 6Erera A L. Design of large-scale logistics systems for uncertain environments[D]. California: University of Colifornia,Berkeley, 2000.
  • 7Bertsimas D J. A vehicle routing problem with stochastic demand[J]. Operations Research, 1992, 40(3):574- 585.
  • 8Laporte G. Model and exact .solutions for a class of stochastic location-routing problems[J]. European Journal of Operations Research, 1989,39 : 71- 78.
  • 9Gendreau M. Invited review for stochastic vehicle touting[J]. European Journal of Operations Research , 1996,88:3-12.
  • 10Psaraftis H. A dynamic programming approach to the single- vehicle many-to-many immediate request dial-a-ride problem [J]. Transportation Science, 1980,14 (2) : 130-154.

共引文献81

同被引文献11

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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