TY - JOUR ID - 116560 TI - On the shortest path calculation time in the large-scale dynamic post-disaster environment JO - Annals of Optimization Theory and Practice JA - AOTP LA - en SN - 2588-3666 AU - Shavarani, Seyed Mahdi AU - Vizvari, Bela AD - Department of Industrial Engineering, Eastern Mediterranean University, Famagusta, Turkey Y1 - 2020 PY - 2020 VL - 3 IS - 2 SP - 65 EP - 80 KW - shortest path KW - Dijkstra Algorithm KW - Bellman Equation KW - post-disaster period KW - emergency vehicle DO - 10.22121/aotp.2020.243077.1038 N2 - There are many metropolitan cities where serious disasters are expected. The disaster, especially if it is an earthquake, damages the roads structure. Thus, the shortest path between two points can be changed. Emergency vehicles, including ambulance, fire-engine, police car, and technical aid, must get the temporary shortest path in real time to work effectively. The shortest path algorithm available in MATLAB, Dijkstra, is tested on two metropolitan cities of San Francisco and Tehran. The road systems of both cities are represented by high number of nodes and connecting arcs. The conclusion is that the algorithm is suitable for finding shortest path for emergency vehicles. However, it is too slow for being a subroutine of a solver for vehicle routing problem. UR - https://aotp.fabad-ihe.ac.ir/article_116560.html L1 - https://aotp.fabad-ihe.ac.ir/article_116560_385fccf2384f0f385ba62c2f9a2f780a.pdf ER -