Chance-constrained stochastic programming models for humanitarian relief network design

Warning The system is temporarily closed to updates for reporting purpose.

Elçi, Özgün (2016) Chance-constrained stochastic programming models for humanitarian relief network design. [Thesis]

[thumbnail of Restricted to Repository staff only until 06.09.2019] PDF (Restricted to Repository staff only until 06.09.2019)
Restricted to Repository staff only

Download (949kB) | Request a copy


Many engineering applications concerned with issues such as the probability of meeting demand or the reliability of a system give rise to mathematical programming models that involve chance (or probabilistic) constraints. First, we focus on optimization models involving individual chance constraints, in which only the right-hand side vector is random with a finite distribution. We develop strong mixed-integer programming formulations for a recently introduced class of chance-constrained models which treats the reliability levels/ risk tolerances associated with the chance constraints as decision variables and trades off the actual cost / return against the cost of the selected reliability levels in the objective function. In addition, we introduce an alternate cost function type associated with the risk tolerances which requires capturing the value-at-risk (VaR) associated with a variable reliability level. We accomplish this task via a new integer linear programming representation of VaR. Our computational study illustrates the effectiveness of our mathematical programming formulations. We also apply the proposed modeling approach to a new stochastic post-disaster relief network design problem and provide numerical results for a case study. Second, we consider a stochastic pre-disaster relief network design problem in which there is uncertainty in post-disaster demands and transportation network conditions. We develop a risk-averse two-stage chance-constrained stochastic programming model which features a mean-risk objective, and a joint probabilistic constraints enforced on the feasibility of the second-stage problem. We employ an exact Benders decomposition-based branch-and-cut algorithm and our extensive numerical analysis demonstrates the computational effectiveness of the solution algorithm.
Item Type: Thesis
Additional Information: Yükseköğretim Kurulu Tez Merkezi Tez No: 461048.
Uncontrolled Keywords: Stochastic programming. -- Risk-aversion. -- Probabilistic constraints. -- Variable reliability. -- Value-at-risk. -- Conditional-value-risk. -- Network design. -- Humanitarian logistics. -- Accessibility. -- Equity. -- Benders decomposition. -- Branch-and-cut. -- Rassal programlama. -- Riskten kaçınma. -- Olasılıksal kısıtlar. -- Değişken güvenilirlik. -- Riske maruz değer. -- Koşullu riske maruz değer. -- Ağ tasarımı. -- İnsani yardım lojistiği. -- Erişilebilirlik. -- Eşitlik. -- Benders ayrıştırması. -- Dal-ve-kesi.
Subjects: T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Industrial Engineering
Faculty of Engineering and Natural Sciences
Depositing User: IC-Cataloging
Date Deposited: 14 May 2018 15:40
Last Modified: 26 Apr 2022 10:24

Actions (login required)

View Item
View Item