O'Hanley, J. and Church, R.L. (2008) Designing Robust Coverage Networks to hedge against Worst-case Facility Losses. Working paper. University of Kent Canterbury, Canterbury
|
Download (272Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Official URL http://www.kent.ac.uk/kbs/research/working-papers.... |
||
Abstract
In order to design a coverage-type service network that is robust to the worst instances of longterm facility loss, we develop a facility location-interdiction model that maximizes a combination of initial coverage given p facilities and the minimum coverage level following the loss of any subset of 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, information is fed back to the upper level master by appending supervalid inequalities, which attempt to force the upper level master away from clearly dominated solutions. Computational results show that when solved to optimality, bilevel decomposition is up to several orders of magnitude faster than performing branch and bound on the mixed integer program.
| Item Type: | Monograph (Working paper) |
|---|---|
| Additional information: | Working Paper Number 173 |
| Uncontrolled keywords: | facility location, maximum covering, interdiction, bilevel programming |
| Subjects: | H Social Sciences > H Social Sciences (General) |
| Divisions: | Faculties > Social Sciences > Kent Business School > Management Science |
| Depositing User: | Jennifer Knapp |
| Date Deposited: | 03 Sep 2010 15:26 |
| Last Modified: | 06 Jan 2012 10:04 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/25469 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
