Designing robust coverage networks to hedge against worst-case facility losses

O'Hanley, Jesse and Church, Richard L. (2011) Designing robust coverage networks to hedge against worst-case facility losses. European Journal of Operational Research, 209 (1). pp. 23-36. ISSN 0377-2217. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/j.ejor.2010.08.030

Abstract

In order to design a coverage-type service network that is robust to the worst instances of long-term facility loss, we develop a facility location-interdiction model that maximizes a combination of initial coverage by p facilities and the minimum coverage level following the loss of the most critical r facilities. The problem is formulated both as a mixed-integer program and as a bilevel mixed-integer program. To solve the bilevel program optimally, a decomposition algorithm is presented, whereby the original bilevel program is decoupled into an upper level master problem and a lower level subproblem. After sequentially solving these problems, supervalid inequalities can be generated and appended to the upper level master in an attempt to force it away from clearly dominated solutions. Computational results show that when solved to optimality, the bilevel decomposition algorithm is up to several orders of magnitude faster than performing branch and bound on the mixed-integer program.

Item Type: Article
Uncontrolled keywords: Location; Reliability; Maximum covering; Interdiction; Bilevel programming; Bilevel decomposition
Subjects: H Social Sciences > H Social Sciences (General)
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Paul Verrion
Date Deposited: 02 Oct 2010 21:44
Last Modified: 02 Jun 2014 15:12
Resource URI: http://kar.kent.ac.uk/id/eprint/25705 (The current URI for this page, for reference purposes)
  • Depositors only (login required):