当前位置:主页 > 经济论文 > 经济发展论文 >

基于动态交通网络的城市物流配送路径优化研究

发布时间:2018-04-03 18:13

  本文选题:城市物流 切入点:TDVRPTW 出处:《深圳大学》2017年硕士论文


【摘要】:车辆路径问题(VRP,Vehicle Routing Problem)是现代物流管理研究中一项十分重要的问题。随着社会和经济的快速发展,人们对货物运输和配送的需求不断增加,门到门物流服务的占比不断上升,配送压力大是负责末端物流配送的物流企业面临的突出问题,同时由于城市居民人数的不断增加,城市规模的不断扩张,交通拥堵已严重影响物流末端的配送效率,这是城市物流企业所面临的又一突出问题。如何在有限的时间里,有效的调度物流运输车辆,通过合理的安排配送车辆的配送路径和出行时间,在克服交通拥堵的情况下以最小的配送成本完成配送任务,实现物流配送系统高效低成本的运作,是当今物流业亟待解决的问题。因此,研究基于动态交通网络的车辆路径问题具有十分重要的现实意义。根据以上背景,本文基于动态交通网络对带时间窗限制的时变条件下城市配送路径优化问题(TDVRPTW,Time-dependent Vehicle Routing Problem With Time Windows)进行了相关研究。论文从城市物流配送及动态交通网络的相关理论出发,针对带时间窗约束的车辆路径规划问题(VRPTW,Vehicle Routing Problem With Time Windows),考虑了物流配送车辆的启用、配送的距离及配送的及时性对配送成本的影响,构建了带有惩罚函数的以最小配送成本为目标的VRPTW路径规划模型,然后考虑动态的交通环境,将VRPTW路径规划模型进行扩充,构建了时变环境下TDVRPTW路径规划模型。通过各种算法对比分析后,确定了以遗传算法作为本文中物流配送路径规划模型的求解算法,设计了适用于求解问题模型的染色体编码方式及具有遗传进化功能的选择、交叉、变异等遗传操作。基于上述模型和优化方法,利用国际公认的标准算例库和深圳市真实物流配送案例进行验证。实验结果表明:(1)针对非时变条件下的VRPTW模型,运用本文所设计的遗传算法对国际公认的标准算例库进行了求解验证,其求解结果已接近现有最优解,表明了该算法的有效性与可行性;(2)动态交通网络下,VRPTW模型及TDVRPTW模型运用本文算法求得的结果进行对比后,发现TDVRPTW模型结果中车辆行驶的总路程与总花费时间在一定程度上大于VRPTW模型结果中车辆行驶的总路程与总花费时间,证明了交通因素对物流配送产生了影响;(3)动态交通网络环境下的物流配送更加接近于现实的城市物流配送。
[Abstract]:Vehicle Routing problem is a very important problem in modern logistics management.With the rapid development of society and economy, people's demand for goods transportation and distribution is increasing, and the proportion of door-to-door logistics services is increasing. Distribution pressure is a prominent problem faced by logistics enterprises in charge of terminal logistics distribution.At the same time, due to the increasing number of urban residents and the continuous expansion of urban scale, traffic congestion has seriously affected the distribution efficiency of logistics terminal, which is another outstanding problem faced by urban logistics enterprises.In the limited time, how to effectively dispatch the logistics transportation vehicles, through the reasonable arrangement of the distribution route and travel time of the distribution vehicles, in order to overcome the traffic congestion with the minimum distribution cost to complete the distribution task.It is an urgent problem for logistics industry to realize the efficient and low cost operation of logistics distribution system.Therefore, it is very important to study the vehicle routing problem based on dynamic traffic network.Based on the above background, this paper studies the time-dependent Vehicle Routing Problem With Time Time problem of urban distribution routing under time-varying conditions with time window constraints based on dynamic traffic network.Based on the related theories of urban logistics distribution and dynamic transportation network, this paper discusses the vehicle routing problem with time window constraint (VRPTW) vehicle Routing Problem With Time Windows, and considers the use of logistics distribution vehicle.Based on the influence of distance and timeliness of distribution on the cost of distribution, this paper constructs a VRPTW path planning model with penalty function, which aims at the minimum distribution cost. Then considering the dynamic traffic environment, the VRPTW path planning model is extended.The TDVRPTW path planning model in time varying environment is constructed.Through the comparison and analysis of various algorithms, the genetic algorithm is chosen as the solution algorithm of the logistics distribution path planning model in this paper, and the chromosome coding method suitable for solving the problem model and the selection and crossover with the function of genetic evolution are designed.Genetic manipulation such as variation.Based on the above model and optimization method, we use the internationally recognized standard case base and Shenzhen real logistics distribution case to verify.The experimental results show that the VRPTW model under time-invariant condition is solved by using the genetic algorithm designed in this paper to validate the internationally accepted standard example library. The results are close to the existing optimal solutions.The validity and feasibility of the algorithm are demonstrated. (2) the model of VRPTW and the model of TDVRPTW under dynamic traffic network are compared with the results obtained by the algorithm in this paper.It is found that the total distance and total cost time of the vehicle in the result of TDVRPTW model is to some extent larger than that of the total distance and total time of the vehicle in the result of VRPTW model.It is proved that transportation factors have an impact on logistics distribution.) under the dynamic traffic network environment, the logistics distribution is closer to the reality of urban logistics distribution.
【学位授予单位】:深圳大学
【学位级别】:硕士
【学位授予年份】:2017
【分类号】:F252.1;TP18

【相似文献】

相关期刊论文 前10条

1 杨凌杰;李静;王辉;孙维维;;基于蚁群算法的配送路径优化系统研究[J];中国制造业信息化;2008年17期

2 张锦;谢克明;;蚁群算法在医药物品配送路径优化中的应用[J];太原理工大学学报;2009年06期

3 范小宁;徐格宁;杨瑞刚;;车辆配送路径优化的新型蚁群算法[J];计算机工程与应用;2011年26期

4 苏涛;王庆斌;孙聪;李文强;;蚁群算法的军事物流配送路径优化[J];海军航空工程学院学报;2012年03期

5 刘金雨;刘亚敏;连浩;张佳惠;王娟;;基于混沌蚁群算法的地震应急物流配送路径优化问题研究[J];山西电子技术;2014年02期

6 黄志刚;林凤涛;;车间配送路径优化的研究[J];华东交通大学学报;2007年04期

7 林凤涛;郭厚q;;基于蚁群算法的车间配送路径优化的仿真研究[J];机械设计与制造;2007年10期

8 徐丽蕊;;基于LINGO的城市物流配送路径优化[J];电子设计工程;2013年22期

9 王茜;;禁忌结合遗传结果对配送路径优化的应用研究[J];计算机应用与软件;2011年06期

10 陈晔;张勇明;赵金超;;复杂军事物流网络的配送路径优化研究[J];舰船电子工程;2013年02期

相关会议论文 前1条

1 张锦;谢克明;;蚁群算法在医药物品配送路径优化中的研究[A];中华医学会医学工程学分会第十次学术年会暨2009中华临床医学工程及数字医学大会论文集[C];2009年

相关硕士学位论文 前10条

1 王仁禄;湖南CF公司药品配送路径优化研究[D];昆明理工大学;2015年

2 林宇肖;考虑油品隔离的成品油城市配送路径优化[D];大连海事大学;2015年

3 陈晶晶;基于改进蚁群算法的美食林公司农产品冷链物流配送路径优化研究[D];河北科技大学;2015年

4 岳美思;时变网络下考虑碳惩罚率的城市配送路径优化模型研究[D];东北大学;2013年

5 王晶;SHJAJ快运公司配送路径优化研究[D];东北大学;2014年

6 李波;基于动态交通网络的城市物流配送路径优化研究[D];深圳大学;2017年

7 李慧;基于蚁群算法的美特好配送路径优化研究[D];山西大学;2011年

8 赵炳乾;基于改进节约法的T公司车辆配送路径优化研究[D];河北工程大学;2013年

9 李靖泽;我国成品油二次配送路径优化研究[D];哈尔滨理工大学;2014年

10 李明泽;城市农产品冷链物流配送路径优化研究[D];大连海事大学;2013年



本文编号:1706341

资料下载
论文发表

本文链接:https://www.wllwen.com/jingjifazhanlunwen/1706341.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户28413***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com