Equitable location of facilities in a region with probabilistic barriers to travel

This paper studies a planar multi-facility location problem that considers the presence of a restricted region with probabilistic position. This problem seeks to locate facilities in an equitable manner by minimizing the maximum expected distance traveled from demand points to access a facility, as well as distances between locations of new facilities. The authors propose a heuristic to solve this problem 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. The authors report findings from a case-study involving locating police facilities in Kingston-Upon-Thames.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01712831
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 13 2019 3:05PM