灾害救援需要物资人力的快速运输，而突发灾害常会影响到道路的通行状态，研究道路网络动态变化情况下救援车辆的实时最快通行路径算法，具有重要的经济和社会意义。针对灾害发生后道路状况多变突变的情况，提出一种实时最快通行路径求解算法 ARFTP(Algorithm of Real-time Fastest Traffic Path)，将结点进行分类筛选，依据相应准则进行运算，减少了需要重新计算的结点和路径数量。当车辆行驶在原定救援最快通行路径上时，实时收到路段变化信息，根据 ARFTP 求解策略可快速求出新的最快通行路径。通过仿真验证了算法的有效性和效率，对提高灾害救援运输效率具有一定的意义。%Disaster rescue needs rapid transportation of both supplies and staff. The abrupt disasters often affect the traffic states, and research on the real-time fastest path under dynamic road conditions has important economic and social values. Aiming at dealing with the abrupt and frequent road variation after disaster, a fast algorithm of real-time Fastest Traffic Path(ARFTP) is proposed, which reduces the amount of re-calculation on the nodes and the sub-paths by classifying the nodes into different types and filtering them, then putting them into corresponding calculation modules, so as to avoid redundant calculations. When the vehicles are on the original shortest path to the disaster area and receive real-time road variation information, the up-to-date fastest shortest path can be calculated by ARFTP rapidly. Experiments have been made to test the correctness and efficiency of ARFTP with many cases of road cases, and the results proved its effect in improving the efficiency which has some guidance significance to disaster relief transportation.
展开▼
