Locating healthcare facilities using a network-based covering location problem

摘要

Where should new service facilities be located is a key question in ensuring healthcare accessibility. In previous healthcare literature, most researchers applied either maximal covering location problem (MCLP) or location set covering problem(LSCP) to address the location selection problems. The MCLP tries to maximize population with access with a limited number of facilities; while the LSCP ensures full coverage with a minimum number of facilities. However, researchers rarely applied both models and compare their results. Moreover, most literature applied Euclidean distance to generate service coverages and failed to demonstrate the geoprocessing steps in the application of location problems with the integration of geographic information system (GIS). To complement existing literature, this paper proposes a network-based covering location problem (Net-CLP) building on traditional location problems. The Net-CLP incorporates two sub-models: a network-based maximal covering location problem(Net-MCLP) and a network-based location set covering problem (Net-LSCP). The goal of Net-CLP in this paper is threefold: (1) the network-based coverage is based on real world transportation networks depending on different travel thresholds; (2) addressing the location problem applying both Net-MCLP and Net- LSCP to fully evaluate candidate facility sites, considering service capabilities; (3) demonstrating the integration of GIS in location problems, with a case study of Hillsborough County, Florida.