期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Research on the Best Routing Algorithm of Terminal Distribution Based on the Random Factor of Road Hustling Degree 被引量:1
1
作者 陈子侠 《Journal of Shanghai Jiaotong university(Science)》 EI 2007年第3期416-420,426,共6页
Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptio... Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptions of economical distance of delivery and the best routing algorithm were given on the base of the Dijkstra algorithm with consideration of a coefficient of the road hustle degree. Economical distance of delivery is the shortest physical distance between two customers. It is the value of goods delivery in shortest distance when concerning factors such as the road length, the hustle degree, the driveway quantity, and the type of the road. The improved algorithm is being used in the development and application of a distribution path information system in the terminal distribution of logistics center. The simulation and practical case prove that the algorithm is effective and reasonable. 展开更多
关键词 logistics and distribution system best routing algorithm road hustling degree geography informationsystem (GIS)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部