The Multiple Gradual Maximal Covering Location Problem

被引:0
|
作者
Price, Ashleigh N. [1 ]
Curtin, Kevin M. [1 ]
机构
[1] Univ Alabama, Dept Geog, Lab Locat Sci, Shelby Hall 2031,Box 870322, Tuscaloosa, AL 35401 USA
关键词
linear programming; location covering models; spatial optimization; MODEL;
D O I
10.1111/gean.12410
中图分类号
P9 [自然地理学]; K9 [地理];
学科分类号
0705 ; 070501 ;
摘要
This article describes a new spatial optimization model, the Multiple Gradual Maximal Covering Location Problem (MG-MCLP). This model is useful when coverage from multiple facilities or sensors is necessary to consider a demand to be covered, and when the quality of that coverage varies with the number of located facilities within the service distance, and the distance from the demand itself. The motivating example for this model uses a coupled GIS and optimization framework to determine the optimal locations for acoustic sensors-typically used in police applications for gunshot detection-in Tuscaloosa, AL. The results identify the optimal facility locations for allocating multiple facilities, at different locations, to cover multiple demands and evaluate those optimal locations with distance-decay. Solving the MG-MCLP over a range of values allows for comparing the performance of varying numbers of available resources, which could be used by public safety operations to demonstrate the number of resources that would be required to meet policy goals. The results illustrate the flexibility in designing alternative spatial allocation strategies and provide a tractable covering model that is solved with standard linear programming and GIS software, which in turn can improve spatial data analysis across many operational contexts.
引用
下载
收藏
页数:13
相关论文
共 50 条
  • [21] Solving the maximal covering location problem with heuristic concentration
    ReVelle, Charles
    Scholssberg, Michelle
    Williams, Justin
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (02) : 427 - 435
  • [22] A bi-level maximal covering location problem
    Martha-Selene Casas-Ramírez
    José-Fernando Camacho-Vallejo
    Juan A. Díaz
    Dolores E. Luna
    Operational Research, 2020, 20 : 827 - 855
  • [23] An algorithm portfolio for the dynamic maximal covering location problem
    Calderin, Jenny Fajardo
    Masegosa, Antonio D.
    Pelta, David A.
    MEMETIC COMPUTING, 2017, 9 (02) : 141 - 151
  • [24] Planar maximal covering location problem with inclined ellipses
    Charkhgard, Hadi
    Jokar, Mohammad R. Akbari
    MECHANICAL AND AEROSPACE ENGINEERING, PTS 1-7, 2012, 110-116 : 4861 - 4866
  • [25] THE MAXIMAL COVERING LOCATION PROBLEM WITH CAPACITIES ON TOTAL WORKLOAD
    PIRKUL, H
    SCHILLING, DA
    MANAGEMENT SCIENCE, 1991, 37 (02) : 233 - 248
  • [26] A note on solutions to the maximal expected covering location problem
    Chiyoshi, FY
    Galvao, RD
    Morabito, R
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (01) : 87 - 96
  • [27] A bi-level maximal covering location problem
    Casas-Ramirez, Martha-Selene
    Camacho-Vallejo, Jose-Fernando
    Diaz, Juan A.
    Luna, Dolores E.
    OPERATIONAL RESEARCH, 2020, 20 (02) : 827 - 855
  • [28] An algorithm portfolio for the dynamic maximal covering location problem
    Jenny Fajardo Calderín
    Antonio D. Masegosa
    David A. Pelta
    Memetic Computing, 2017, 9 : 141 - 151
  • [29] The gradual covering problem
    Drezner, Z
    Wesolowsky, GO
    Drezner, T
    NAVAL RESEARCH LOGISTICS, 2004, 51 (06) : 841 - 855
  • [30] The Competitive Location Problem under Gradual Cover and Different Covering Radius
    Zhang, Xi
    Zhou, Zu-cai
    PROCEEDINGS OF THE 2009 SECOND PACIFIC-ASIA CONFERENCE ON WEB MINING AND WEB-BASED APPLICATION, 2009, : 301 - +