 |
International Society of Science and Applied Technologies |
| Improving Optimal Strategies Search for Maximum Flow Network Interdiction | ||||
| Author | Natsumi Takahashi
|
|||
| Co-Author(s) | Tetsushi Yuge
|
|||
| Abstract | Network Interdiction Problems are related to identifying components that should be interdicted. This study considers the network interdiction problem whose objective is the maximum network flow. This interdiction problem is between two parties known as an evader and an interdictor. An evader aims to maximize the expected flows which are transmitted from a source to a sink without being detected. In this study, flows are detected stochastically at each arc. On the other hand, an interdictor seeks to minimize the maximum expected flows of evader by interdicting arcs. In this situation, we need to effectively obtain the flows that maximize the expected flows considering the detection probability, and determine which arcs are the best to interdict.
|
|||
| Keywords | Flow, Network Interdiction Problem, Stochastic Network | |||
| Article #: RQD2025-203 | ||||
Proceedings of 30th ISSAT International Conference on Reliability & Quality in Design |