基于Dijkstra算法的城市物流公交系统优化

Public Transportation System Optimization of Urban Logistics Based on Dijkstra Algorithm

为了解决物流系统中的货车分配和货车收回问题,对整个社会物流信息进行快速收集及整合,能高效地处理这些数据,提高物流公交效率节约成本支出,文中提出了基于Dijkstra算法的物流优化系统。本系统分为两个阶段,一是货车分配问题,二是货车回收问题。货车分配问题分为多车一货同地点分配、多车一货异地分配和多车多货异地分配。利用单源最短路径算法思想,根据货车和货物的所在位置、货车至货物的距离以及货车承载量和体积、货物的重量和体积来确定分配的货车。第二阶段是货车回收问题,通过判断货车的状态来确定是否对货车进行回收,送货物到达目的地的货车所有参数都会进行初始化,把目的地改为出发地,重新加入分配货车信息系统。通过实验数据证明,本算法对物流公交具有较高的使用价值。

In order to solve the problem of truck distribution and truck recovery in the logistics system,collect and integrate the logistics information of the whole society quickly,process these data effectively,and improve the efficiency of logistics public transportation,we propose a logistics optimization system based on Dijkstra algorithm.The system is divided into two stages,one is the truck distribution,the other is the truck recovery.The truck distribution can be divided into multi vehicle and one goods distribution in the same place,multi vehicle and one goods distribution in different places,and multi vehicle and multi goods distribution in different places.The Dijkstra algorithm is used to determine the distribution of trucks according to the location of trucks and goods,the distance between trucks and goods,the carrying capacity and volume of freight cars trucks,and the weight and volume of goods.The second stage is the recovery of trucks.By judging the status of trucks,we can determine whether to recycle the trucks.All parameters of the trucks delivered to the destination will be initialized,and the destination will be changed to the departure place,and the distribution of trucks information system will be rejoined.The experimental data show that the proposed algorithm has a high use value for logistics public transportation.