Article ID: | iaor20164359 |
Volume: | 50 |
Issue: | 1 |
Start Page Number: | 336 |
End Page Number: | 347 |
Publication Date: | Feb 2016 |
Journal: | Transportation Science |
Authors: | Berman Oded, Verter Vedat, Aboolian Robert |
Keywords: | combinatorial optimization, heuristics, government, design, networks, simulation, programming: nonlinear, programming: integer |
This paper focuses on designing facility networks in the public sector so as to maximize the number of people benefiting from their services. We develop an analytical framework for the maximal accessibility network design problem that involves determining the optimal number, locations, and capacities of a network of public sector facilities. We assume that the time spent for receiving the service from a facility is a good proxy for its accessibility. We provide a generic model that incorporates both the congestion at the facilities and the customer‐choice environment that underlies most of the services offered by the public sector. We devise an ϵ‐optimal algorithm for the arising nonlinear integer program. The proposed algorithm performs well in tackling fairly large problem instances. Through a realistic example based on the hospital network of Toronto, we demonstrate the model’s capability in providing policy insights.