不确定因素下一类物流车最优路径模型的建立与求解

Abstract

本文以徐州市圆通快递文化宫营业部到中国矿业大学南湖校区为研究对象，建立了不确定因素下最优路径模型，利用正态分布的可加性，得出各条路径的总行驶时间正态分布表达式，并进行标准化，解出行驶时间的表达式。当到达终点的概率确定时，最优路径为行驶时间最少的路径。在此基础上设计了基于深度优先搜索的最优路径算法，运用MATLAB编程，得出7条不同的路径，求出最短行驶时间和最优路径。 This paper has established the optimal path model under uncertain factors as the subject of re-search, i.e., from Culture Palace Business Department of Xuzhou Yuantong Express to Nanhu Cam-pus of China University of Mining and Technology. By using the additive property of the normal distribution, the expression of the normal distribution for travel time of each path has been ob-tained, which is standardized to derive the expression of travel time. When the probability of reaching the end point is determined, the optimal path is the path with the shortest travel time. On this basis, the optimal path algorithm based on depth-first search is designed, and seven different paths are obtained by MATLAB programming. The minimum travel time and the optimal path are obtained.