Login | Register

Facility Location Planning Under Disruption


Facility Location Planning Under Disruption

Afify, Badr (2020) Facility Location Planning Under Disruption. PhD thesis, Concordia University.

[thumbnail of Afify_PhD_S2020.pdf]
Text (application/pdf)
Afify_PhD_S2020.pdf - Accepted Version


Facility Location Problems (FLPs) such as the Uncapacitated Facility Location (UFL) and the Capacitated Facility Location (CFL) along with the k-Shortest Path Problem (k-SPP) are
important research problems in managing supply chain networks (SCNs) and related operations. In UFL, there is no limit on the facility serving capacity while in CFL such limit is
imposed. FLPs aim to find the best facility locations to meet the customer demands within the available capacity with minimized facility establishment and transportation costs. The objective of the (k-SPP) is to find the k minimal length and partial overlapping paths between two nodes in a transport network graph. In the literature, many approaches are proposed to solve these problems. However, most of these approaches assume totally reliable facilities and do not consider the failure probability of the facilities, which can lead to notably higher cost. In this thesis, we investigate the reliable uncapacitated facility location (RUFL)and the reliable
capacitated facility location (RCFL) problems, and the k-SPP where potential facilities are exposed to disruption then propose corresponding solution approaches to efficiently
handle these problems. An evolutionary learning technique is elaborated to solve RUFL. Then, a non-linear integer programming model is introduced for the RCFL along with a
solution approach involving the linearization of the model and its use as part of an iterative procedure leveraging CPLEX for facility establishment and customer assignment along with a knapsack implementation aiming at deriving the best facility fortification. In RUFL and RCFL, we assume heterogeneous disruption with respect to the facilities, each customer is assigned to primary and backup facilities and a fixed fortification budget allows to make a subset of the facilities totally reliable. Finally, we propose a hybrid approach based on graph partitioning and modified Dijkstra algorithm to find k partial overlapping shortest paths between two nodes on a transport network that is exposed to heterogeneous connected node failures. The approaches are illustrated via individual case studies along with corresponding key insights. The performance of each approach is assessed using benchmark results. For the k-SPP, the effect of preferred establishment locations is analyzed with respect to disruption scenarios, failure probability, computation time, transport costs, network size
and partitioning parameters.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Concordia Institute for Information Systems Engineering
Item Type:Thesis (PhD)
Authors:Afify, Badr
Institution:Concordia University
Degree Name:Ph. D.
Program:Information and Systems Engineering
Date:22 January 2020
Thesis Supervisor(s):Awasthi, Anjali
ID Code:986371
Deposited By: BADR AFIFY
Deposited On:25 Jun 2020 18:22
Last Modified:25 Jun 2020 18:22
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