节点文献

电商企业“爆仓”背景下物流配送网络及路径优化方法研究

Study on E-commerce Optimization Method of Logistics Distribution Path under the Background of the Explosion

【作者】 李斌

【导师】 孔峰;

【作者基本信息】 华北电力大学 , 工程硕士(专业学位), 2018, 硕士

【摘要】 社会在进步,科技在发展,伴随者互联网时代的前进步伐,一些新型行业开始迅速崛起。特别是近年来电商行业如淘宝、京东等发展速度出人意料却又在情理之中。总之,电子商务的发展势必会给人类带来一次产业革命。但随着网上购物的逐渐成熟与应用,与之产生的交通压力无疑是对现有的城市交通问题的进一步冲击,比如双十一购物节,各大快递商货物爆仓对交通压力的影响。另一方面目前现有的物流车辆监控管理尚不善,存在着运输效率低下,运输成本高,优化调度实时性差,车辆行驶信息收集难,不能随时掌握车辆的精确位置,以及驾驶员超速行驶、跑私车和乱停乱放现象难以控制等问题。因此如何对配送过程中的车辆进行有效地监控和管理是物流企业以及社会所急需解决的一个重大课题。首先,结合国内外研究现状,阐述相关理论。在查阅大量文献的基础上,对国内外研究现状进行整合,提出本文研究的目的及意义。在理论的基础上,对文章涉及到的相关理论概念进行阐述,为后续分析问题、解决问题提供理论基础。为发现网络中的“瓶颈”环节,优化作业能力进而提高网络物流运作能力提供参考思路。其次,就是完成了大规模爆发性物流应急物流网络布局优化的整体的设计。首先调研分析了现阶段物流电商企业应对“爆仓”背景下的物流供应环节和配送环节存在的问题。在此基础上,阐述了应对大规模“爆仓”背景下物流应急物流网络布局优化的必要性和方法选择。随后制定了“爆仓”背景下物流网络布局优化的相关策略以指导后文的具体优化。最后,论文基于以上分析,得出了大规模爆发性物流应急物流网络整体布局设计。最后研究了“爆仓”背景下物流中配送车辆规划与调度问题。首先,基于多维时空网络方法建立随机性爆发性物流配送模型并对模型进行修正,该模型以“平均值”的概念考虑随机性因素,使用“缓冲值”概念并依据相关随机性因素进行调整。其次,利用软时窗限制约束条件,以优化最小惩罚函数为目标,改进VRP-TW算法,并使用插入式算法对其求解,最终实现整个配送时间最短。最后,考虑物资配送终端配送站配送过程中的不确定性,探讨了基于实时信息的动态VRP,以所有路线惩罚函数最小为目标,使用禁忌搜索法求解消费集中区域内配送车辆送货路线的动态更新问题,最终实现运输成本总和最小化。

【Abstract】 In the progress of society,the development of science and technology,and the pace of the development of the Internet age,some new industries have begun to rise rapidly.In particular,in recent years,e-commerce industry,such as Taobao,Jingdong and other development speed unexpected,but in the sense.In a word,the development of e-commerce is bound to bring an industrial revolution to human beings.But with the online shopping gradually mature and application,and the traffic pressure will be further impact on the existing traffic problems of the city,such as the double eleven Shopping Festival,the major influence on Business Express cargo warehouse explosion traffic pressure.On the other hand,the logistics vehicle monitoring and management still exist existing poor,inefficient transport,high transport costs,optimal scheduling of real-time vehicle information collection difficult,can not grasp the exact position of the vehicle,and the driver speeding,running and private cars phenomenon is difficult to control and other issues.Therefore,how to effectively monitor and manage the vehicles in the distribution process is a major problem that the logistics enterprises and the society urgently need to solve.First of all,combined with the current research status at home and abroad,the relevant theories are expounded.On the basis of consulting a large number of documents,the current research status at home and abroad is integrated,and the purpose and significance of this study are put forward.On the basis of the theory,this paper expounds the relevant theoretical concepts involved in the article,and provides a theoretical basis for the subsequent analysis of the problem and the solution of the problem.In order to find the "bottleneck" link in the network,optimize the operation ability and further improve the network logistics operation ability to provide a reference.Secondly,it has completed the overall design of the large-scale burst logistics emergency logistics network layout optimization.First of all,the research and analysis of the current phase of self built logistics enterprises to deal with large-scale logistics logistics supply links and distribution link problems.On this basis,the necessity and method selection of large-scale explosive logistics emergency logistics network layout optimization are expounded.Subsequently,the relevant strategies for optimizing the layout of the emergency logistics network are formulated to guide the specific optimization of the post.Finally,based on the above analysis,the overall layout design of the large-scale explosive logistics emergency logistics network is obtained.The problem of emergency vehicle planning and scheduling in emergency logistics is studied in this paper.First,based on the multi-dimensional space-time network method,a stochastic explosive logistics distribution model is established and the model is modified.The model takes the concept of "average value" into account for stochastic factors,and applies the concept of "buffer value" and adjusts according to the related stochastic factors.Secondly,based on the constraint condition of soft time window and the goal of optimizing the minimum penalty function,we improve the VRP-TW algorithm and solve it by inserting algorithm,and ultimately achieve the shortest travel time.Finally,considering the material distribution terminal distribution station distribution of uncertainty in the process of dynamic VRP based on real-time information on all routes minimum penalty function as the goal,using tabu search method to solve the problem of dynamic updating of disaster emergency vehicle delivery routes,and ultimately realize the transportation cost minimization of the sum.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络