EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

4156. Exploring Strategy for Stochastic Maximum Flow Network Interdiction Problem

Invited abstract in session MA-55: Transportation Network Modelling and Optimization I, stream Transportation.

Monday, 8:30-10:00
Room: S02 (building: 101)

Authors (first author is the speaker)

1. Natsumi Takahashi
Department of Electrical and Electronic Engineering, National Defense Academy
2. Tetsushi Yuge
Dept. of Electrical and Electronics, National Defense Academy Japan

Abstract

In this paper, we consider the network interdiction problem using the network flow as the performance measure. An evader wishes to maximize the expected flow of some illegal commodities such as drugs without being detected. On the other hand, a defender aims to minimize the objective of the evader by interdiction activities, such as adding some security controls, that can alter the probability measures.
In this study, flows are intercepted stochastically at each arc, and the expected flow is calculated by considering the penalty cost when the network flow is detected. We need to determine which path from the source to the sink in the network can most effectively maximize the expected flow considering the detection probability, and to determine which arc is the best to interdict. To minimize flow, the defender increases the detection probabilities of arc with a cost by interdiction activities. Under the total interdiction cost constraint, whether each arc is to be interdicted or not is the decision to be made. This paper proposes an efficient search method for optimal interdicted arcs in such situations.

Keywords

Status: accepted

Back to the list of papers