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.
引用
收藏
页码:114 / 126
页数:13
相关论文
共 50 条
  • [41] AN EXTENDED CONTINUOUS MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT
    MEHREZ, A
    STULMAN, A
    COMPUTERS & OPERATIONS RESEARCH, 1984, 11 (01) : 19 - 23
  • [42] A New Heuristic Formulation for a Competitive Maximal Covering Location Problem
    Seyhan, Tolga H.
    Snyder, Lawrence, V
    Zhang, Ying
    TRANSPORTATION SCIENCE, 2018, 52 (05) : 1156 - 1173
  • [43] Using quantum computing to solve the maximal covering location problem
    Alejandro Giraldo-Quintero
    Juan G. Lalinde-Pulido
    Juan C. Duque
    Daniel Sierra-Sosa
    Computational Urban Science, 2
  • [44] An Extension of Maximal Covering Location Problem based on the Choquet Integral
    Takaci, Aleksandar
    Stajner-Papuga, Ivana
    Drakulic, Darko
    Maric, Miroslav
    ACTA POLYTECHNICA HUNGARICA, 2016, 13 (04) : 205 - 220
  • [45] Guided Fireworks Algorithm Applied to the Maximal Covering Location Problem
    Tuba, Eva
    Dolicanin, Edin
    Tuba, Milan
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT I, 2017, 10385 : 501 - 508
  • [46] An Efficient Hybrid Method for an Expected Maximal Covering Location Problem
    Tavakkoli-Mogahddam, R.
    Ghezavati, V. R.
    Kaboli, A.
    Rabbani, M.
    NEW CHALLENGES IN APPLIED INTELLIGENCE TECHNOLOGIES, 2008, 134 : 289 - +
  • [47] NEW MODEL OF MAXIMAL COVERING LOCATION PROBLEM WITH FUZZY CONDITIONS
    Drakulic, Darko
    Takaci, Aleksandar
    Maric, Miroslav
    COMPUTING AND INFORMATICS, 2016, 35 (03) : 635 - 652
  • [48] POLYHEDRAL RESULTS AND VALID INEQUALITIES FOR THE MAXIMAL COVERING LOCATION PROBLEM
    Chen, Sheng-Jie
    Chen, Liang
    Bao, Wen-Cheng
    Wei, Zhou
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (10) : 2441 - 2456
  • [49] The Cooperative Maximal Covering Location Problem with ordered partial attractions
    Dominguez, Concepcion
    Gazquez, Ricardo
    Morales, Juan Miguel
    Pineda, Salvador
    COMPUTERS & OPERATIONS RESEARCH, 2024, 170
  • [50] The probabilistic gradual covering location problem on a network with discrete random demand weights
    Berman, Oded
    Krass, Dmitry
    Wang, Jiamin
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) : 1493 - 1500