MULTIPLE-SINK SHORTEST PATH NETWORK INTERDICTION PROBLEM

---

Atıf İçin Kopyala

AYYILDIZ E., Özçelik G., Demirci E.

SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, cilt.9, sa.4, ss.395-403, 2018 (ESCI)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 9 Sayı: 4
• Basım Tarihi: 2018
• Dergi Adı: SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI
• Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Academic Search Premier, Directory of Open Access Journals
• Sayfa Sayıları: ss.395-403
• Yıldız Teknik Üniversitesi Adresli: Evet

Özet

This paper defines and studies the multiple-sink shortest path problem (MS-NIP). The MS-NIP corresponds to many real-life problems relating to especially terrorist actions. In the MS-NIP, a network user seeks the shortest path to meet the demands of sink nodes while an interdictor aims to maximize the shortest path of a network user by interdicting the arc(s). In this study, we formulate exact mathematical models of the network user and interdictor for the MS-NIP and apply them on an illustrative example. We test the model depending on the different interdiction budget levels and discuss the obtained results.