DETERMINING THE MOST VITAL ARCS ON THE SHORTEST PATH FOR FIRE TRUCKS IN TERRORIST ACTIONS THAT WILL CAUSE FIRE

---

Atıf İçin Kopyala

Ayyıldız E., Özçelik G., Gencer C.

COMMUNICATIONS FACULTY OF SCIENCES UNIVERSITY OF ANKARA-SERIES A1 MATHEMATICS AND STATISTICS, cilt.68, ss.441-450, 2019 (ESCI)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 68
• Basım Tarihi: 2019
• Doi Numarası: 10.31801/cfsuasmas.425508
• Dergi Adı: COMMUNICATIONS FACULTY OF SCIENCES UNIVERSITY OF ANKARA-SERIES A1 MATHEMATICS AND STATISTICS
• Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), TR DİZİN (ULAKBİM)
• Sayfa Sayıları: ss.441-450
• Anahtar Kelimeler: Shortest path, network interdiction, mathematical modeling, terrorist actions, NETWORK INTERDICTION PROBLEMS, FLOW INTERDICTION, FORMULATION, ALGORITHMS
• Gazi Üniversitesi Adresli: Evet

Özet

In case of fire, the supplying of the water requirements of the fire area is a vital issue. The water requirements must be satis.ed as quickly as possible without encountering any obstacles. In the study, once a terrorist attack which will cause fire at certain area (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 arc(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 (NIP), where there are two opposite sides as leader (terrorist) and follower (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.