| 基于道路堵塞及顾客时间要求的快件配送最优路径选择 |
| |
| 引用本文： | 樊相宇,梁日丽,武小平.基于道路堵塞及顾客时间要求的快件配送最优路径选择[J].运筹与管理,2019,28(12):55-61. |
| |
| 作者姓名： | 樊相宇 梁日丽 武小平 |
| |
| 作者单位： | 1. 西安邮电大学 a. 邮政研究院;b. 现代邮政学院,陕西 西安 710061 |
| |
| 基金项目： | 不确定视角下快递企业末端配送优化策略研究-以西安市为例(18JK0705);基于网络分区的物流配送碳足迹优化研究(2019JM-369);城市快递网络抗毁性研究—以西安市为例(XDWL1906) |
| |
| 摘 要： | 针对道路堵塞如节假日导致的临时最短配送路径失效的问题,提出配送网络最优路径选择模型,并设计了求解快递配送网络关键边和最优路径的算法。首先,计算出整个网络的关键边,掌握配送网络特征;其次,考虑顾客时间要求,研究不完全信息(中断无法提前预知,只有到达中断边的起点处才可知)下的最优路径,根据最短路径上各边新的特点,计算出每条边中断后对应的一组备用路径,再选择运输时间小于或等于顾客可等待时间的路径为有效路径,考虑道路堵塞情况,从有效路径中选择最优路径;最后,结合配送网络的实际情况对最优路径进行了算例分析。
|
| 关 键 词： | 最短路径 关键边 Dijkstra算法 最优路径 |
| 收稿时间： | 2018-04-13 |
Optimal Route Selection of Express Delivery Based on Road Congestion and Customer Time Requirements |
| |
| FAN Xiang-yu,LIANG Ri-li,WU Xiao-ping.Optimal Route Selection of Express Delivery Based on Road Congestion and Customer Time Requirements[J].Operations Research and Management Science,2019,28(12):55-61. |
| |
| Authors: | FAN Xiang-yu LIANG Ri-li WU Xiao-ping |
| |
| Affiliation: | 1. Xi’an University of Posts and Telecommunications a. Postal Research Institute;b. Modern Postal College, Xi’an 710061, China |
| |
| Abstract: | Aiming at the problem of ineffective temporary shortest distribution path caused by road congestion such as holidays, this paper proposes an optimal route selection model for distribution network, and designs an algorithm to solve the key edges and optimal path of express distribution network. Firstly, the key edges of the whole network are calculated and the characteristics of distribution network are mastered. Secondly, considering the customer’s time requirement, the optimal path under incomplete information(interruption can not be predicted in advance, only when it reaches the starting point of interruption edge)is studied. According to the new characteristics of each side of the shortest path, a set of reserve paths corresponding to each side after interruption are calculated, and then the paths with transportation time less than or equal to the waiting time of customers are selected as the effective paths. Considering road congestion, the optimal paths are selected from the effective paths. Finally, according to the actual situation of distribution network, the optimal paths are selected. An example is given to analyze the optimal path. |
| |
| Keywords: | shortest path critical edge dijkstra algorithm optimal path |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《运筹与管理》浏览原始摘要信息 |
|
点击此处可从《运筹与管理》下载全文 |
|
