物资调运时间为区间数的最短路问题研究

Research on the Shortest Path of Material Transportation in Interval Time

摘要: 针对紧急状态下物资调配时间为区间数问题,在经典的Dijkstra算法基础上,通过定义一个算子,把区间数序关系转换成实数序关系,对区间数进行排序,给出了区间数的最短路算法。

Abstract: For the question of material transportation in emergency situation,the paper gives an arithmetic operators,which changes the interval number order into real number order,and gives the arithmetic of interval number shortest path.