Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

Authors : Ertuğrul AYYILDIZ, Gökhan ÖZÇELİK, Cevriye TEMEL GENCER

Pages : 441-450

Doi:10.31801/cfsuasmas.425508

View : 18 | Download : 10

Publication Date : 2019-02-01

Article Type : Research Paper

Abstract :In case of fire, the supplying of the water requirements of the fire area is a vital issue. The water requirements must be satisfied as quickly as possible without encountering any obstacles. In the study, once a terrorist attack which will cause fire at certain area insert ignore into journalissuearticles values(node); is occurred, the situation in which the terrorists want to prevent the fire trucks` transportation to this area via the shortest path is considered. The main logic of the study is determining the risky arcinsert ignore into journalissuearticles values(s); that will interdict and presenting a relatively safety paths for the fire trucks. Terrorists wants to maximize the shortest path of fire trucks depending on limited interdiction budget. In this context, the problem is considered within the framework of the Network Interdiction Problem insert ignore into journalissuearticles values(NIP);, where there are two opposite sides as leader insert ignore into journalissuearticles values(terrorist); and follower insert ignore into journalissuearticles values(fire truck);. As a result, the bi-level model of the problem is presented first, and the model is applied on a numerical explanatory example.
Keywords : Shortest path, network interdiction, mathematical modeling, terrorist actions