Equitable location of facilities in a region with probabilistic barriers to travel . - Article - Juillet 2019

This paper studies a planar multi-facility location problem characterized by an explicit consideration of equi- tability measure using the maximum distance metric and the presence of a restricted region with probabilistic position. This problem aims to minimize the maximum expected distance traveled from demand points to access a facility, as well as distances between locations of new facilities. We propose to solve the problem with a heuristic that combines a bounding approach with a split-divide-and-conquer strategy. Computational study shows that this heuristic produces high-quality solutions in reasonable run-times. We report findings from a case-study involving the police facility locations in Kingston-Upon-Thames.