z-logo
open-access-imgOpen Access
Robust Facility Location Under Disruptions
Author(s) -
Chun Cheng,
Yossiri Adulyasak,
Louis-Martin Rousseau
Publication year - 2021
Publication title -
informs journal on optimization
Language(s) - English
Resource type - Journals
eISSN - 2575-1492
pISSN - 2575-1484
DOI - 10.1287/ijoo.2021.0054
Subject(s) - facility location problem , robust optimization , mathematical optimization , flexibility (engineering) , computer science , set (abstract data type) , linear programming , constraint (computer aided design) , column generation , scheme (mathematics) , enumeration , operations research , mathematics , mathematical analysis , statistics , geometry , combinatorics , programming language
Facility networks can be disrupted by, for example, power outages, poor weather conditions, or natural disasters, and the probabilities of these events may be difficult to estimate. This could lead to costly recourse decisions because customers cannot be served by the planned facilities. In this paper, we study a fixed-charge location problem (FLP) that considers disruption risks. We adopt a two-stage robust optimization method, by which facility location decisions are made here and now and recourse decisions to reassign customers are made after the uncertainty information on the facility availability has been revealed. We implement a column-and-constraint generation (C&CG) algorithm to solve the robust models exactly. Instead of relying on dualization or reformulation techniques to deal with the subproblem, as is common in the literature, we use a linear programming–based enumeration method that allows us to take into account a discrete uncertainty set of facility failures. This also gives the flexibility to tackle cases when the dualization technique cannot be applied to the subproblem. We further develop an approximation scheme for instances of a realistic size. Numerical experiments show that the proposed C&CG algorithm outperforms existing methods for both the robust FLP and the robust p-median problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here