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 条
  • [1] The gradual minimum covering location problem
    Khatami, Mostafa
    Salehipour, Amir
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2023, 74 (04) : 1092 - 1104
  • [2] Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem
    Alizadeh, R.
    Nishi, T.
    2019 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2019, : 865 - 869
  • [3] The gradual covering decay location problem on a network
    Berman, O
    Krass, D
    Drezner, Z
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (03) : 474 - 480
  • [4] The Ordered Gradual Covering Location Problem on a Network
    Berman, Oded
    Kalcsics, Joerg
    Krass, Dmitry
    Nickel, Stefan
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (18) : 3689 - 3707
  • [5] The generalized maximal covering location problem
    Berman, O
    Krass, D
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (06) : 563 - 581
  • [6] The maximal covering location disruption problem
    Lunday, Brian J.
    COMPUTERS & OPERATIONS RESEARCH, 2024, 169
  • [7] THE PLANAR MAXIMAL COVERING LOCATION PROBLEM
    CHURCH, RL
    JOURNAL OF REGIONAL SCIENCE, 1984, 24 (02) : 185 - 201
  • [8] On the fuzzy maximal covering location problem
    Arana-Jimenez, Manuel
    Blanco, Victor
    Fernandez, Elena
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 283 (02) : 692 - 705
  • [9] MAXIMAL COVERING LOCATION PROBLEM AND THE GENERALIZED ASSIGNMENT PROBLEM
    KLASTORIN, TD
    MANAGEMENT SCIENCE, 1979, 25 (01) : 107 - 112
  • [10] The large scale maximal covering location problem
    Zarandi, M. H. Fazel
    Davari, S.
    Sisakht, S. A. Haddad
    SCIENTIA IRANICA, 2011, 18 (06) : 1564 - 1570