Achieving Least Relocation of Existing Facilities in Spatial Optimisation: A Bi-Objective Model (Short Paper)

Authors Huanfa Chen , Rongbo Xu



PDF
Thumbnail PDF

File

LIPIcs.GIScience.2023.19.pdf
  • Filesize: 0.52 MB
  • 5 pages

Document Identifiers

Author Details

Huanfa Chen
  • Centre for Advanced Spatial Analysis, University College London, UK
Rongbo Xu
  • Centre for Advanced Spatial Analysis, University College London, UK

Cite AsGet BibTex

Huanfa Chen and Rongbo Xu. Achieving Least Relocation of Existing Facilities in Spatial Optimisation: A Bi-Objective Model (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 19:1-19:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.GIScience.2023.19

Abstract

Spatial optimisation models have been widely used to support locational decision making of public service systems (e.g. hospitals, fire stations), such as selecting the optimal locations to maximise the coverage. These service systems are generally the product of long-term evolution, and there usually are existing facilities in the system. These existing facilities should not be neglected or relocated without careful consideration as they have financial or management implications. However, spatial optimisation models that account for the relocation or maintenance of existing facilities are understudied. In this study, we revisit a planning scenario where two objectives are adopted, including the minimum number of sites selected and the least relocation of existing facilities. We propose and discuss three different approaches that can achieve these two objectives. This model and the three approaches are applied to two case studies of optimising the retail stores in San Francisco and the large-scale COVID-19 vaccination network in England. The implications of this model and the efficiency of these approaches are discussed.

Subject Classification

ACM Subject Classification
  • Information systems → Geographic information systems
Keywords
  • spatial optimisation
  • location set cover problem
  • multiple objective

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Huanfa Chen, Alan T. Murray, and Rui Jiang. Open-source approaches for location cover models: capabilities and efficiency. Journal of Geographical Systems, 23(3):361-380, April 2021. Publisher: Springer. URL: https://doi.org/10.1007/s10109-021-00350-w.
  2. Richard L. Church and Alan Murray. Location covering models: History, applications and advancements. Springer, New York, 2018. Google Scholar
  3. Xin Feng, James D Gaboardi, Elijah Knaap, Sergio J Rey, and Ran Wei. Pysal/spopt. URL: https://doi.org/10.5281/zenodo.4444156.
  4. GNU Project. GLPK (GNU Linear Programming Kit), version 4.65, 2017. URL: http://www.gnu.org/software/glpk.
  5. Inc. Gurobi Optimization. Gurobi Optimizer Reference Manual, 2016. URL: http://www.gurobi.com.
  6. Miettinen Kaisa. Nonlinear Multiobjective Optimization, volume 12 of International Series in Operations Research & Management Science. Kluwer Academic Publishers, Boston, USA, 1999. Google Scholar
  7. Alan T. Murray. Optimising the spatial location of urban fire stations. Fire Safety Journal, 62(PART A):64-71, November 2013. Publisher: Elsevier. URL: https://doi.org/10.1016/j.firesaf.2013.03.002.
  8. Donald R. Plane and Thomas E. Hendrick. Mathematical programming and the location of fire companies for the denver fire department. Operations Research, 25(4):563-578, August 1977. Publisher: INFORMS. URL: https://doi.org/10.1287/opre.25.4.563.
  9. Constantine Toregas, Ralph Swain, Charles ReVelle, and Lawrence Bergman. The location of emergency service facilities. Operations Research, 19(6):1363-1373, October 1971. Publisher: INFORMS. URL: https://doi.org/10.1287/opre.19.6.1363.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail