Login | Register

Exact Algorithms for Network Fortification and Design Problems under Stochastic Interdiction

Title:

Exact Algorithms for Network Fortification and Design Problems under Stochastic Interdiction

Mahmoudzadeh Vaziri, Shabnam (2024) Exact Algorithms for Network Fortification and Design Problems under Stochastic Interdiction. PhD thesis, Concordia University.

[thumbnail of Mahmoudzadeh Vaziri_PhD_F2024.pdf]
Preview
Text (application/pdf)
Mahmoudzadeh Vaziri_PhD_F2024.pdf - Accepted Version
Available under License Spectrum Terms of Access.
8MB

Abstract

Networks such as telecommunication, transportation, and logistics play a vital role in sustaining social, economic, and industrial operations. However, networks are at risk of natural and man-made disruptions. With the increasing interconnectivity of networks, a disruption in one network can negatively affect other networks. We use network interdiction models to analyze the effects of disruptions on the networks. Interdiction models represent a two-player sequential game between the interdictor, seeking to maximize damage, and the network operator, striving to optimize operations after interdiction. Network interdiction models identify the critical nodes and/or arcs of the network and can be extended to fortify the existing networks or design resilient networks. In this thesis, we study the design of distribution and multicommodity networks and the fortification of spanning trees under stochastic interdictions.

The first paper investigates the distribution network design problem considering the effect of interdictions. Since interdiction outcomes can be uncertain in the real world, we consider the interdiction outcome as an uncertain parameter. We extend the model to consider the correlated facility interdictions where interruptions at one facility affect the nearby facilities. We Benders decomposition algorithm. Improved by two acceleration techniques to solve the model.

In the second paper, we focus on the design of a multicommodity network with interdictions. The designer does not have information about the interdiction resources; therefore, we consider the uncertainty in the number of interdictions by presenting a tri-level stochastic mathematical model. We present a branch-and-Benders-cut (BBC) algorithm enhanced by several acceleration techniques to solve the model.

In the third paper, we study the fortification of minimum spanning tree (MST) and optimum communication spanning tree (OCST) problems under stochastic number of interdictions. The MST aims to connect all nodes in a graph with minimal installation cost while satisfying communication requirements with minimum communication cost. The goal is to find the optimal fortification strategy so that the increase in the MST/OCST costs due to the interdiction of unfortified edges is minimized by presenting a tri-level stochastic model. We use backward sampling framework with acceleration technique to solve the deterministic and stochastic MST/OCST fortification problems.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Mechanical, Industrial and Aerospace Engineering
Item Type:Thesis (PhD)
Authors:Mahmoudzadeh Vaziri, Shabnam
Institution:Concordia University
Degree Name:Ph. D.
Program:Industrial Engineering
Date:22 April 2024
Thesis Supervisor(s):Kuzgunkaya, Onur and Vidyarthi, Navneet
ID Code:994037
Deposited By: Shabnam Mahmoudzadeh Vaziri
Deposited On:24 Oct 2024 17:56
Last Modified:24 Oct 2024 17:56
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top