The police vehicle location-allocation problem

被引:0
|
作者
Sher, M. [1 ]
Adler, N. [1 ]
Hakkert, A. S. [1 ]
Ben-Nun, A. [1 ]
机构
[1] Israel Police HQ, Jerusalem, Israel
关键词
police vehicle location; Police vehicle allocation;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
The main aim of this research is to develop and apply location optimization formulations in conjunction with a geographic information system (GIS) to allocate police patrol vehicles such that the police car road coverage in a specific area is maximized. We will demonstrate this using a case study based on the interurban road network of Northern Israel. Currently it is standard practice around the world to allocate routine police vehicles based on an analysis of the frequent accidents on the roads, commonly known as 'hazardous locations'. In Israel, a traffic model assigns vehicles based on accident severity and traffic volume. The assumption to date is that the presence of a police vehicle on roads with high traffic volumes, which generally also have large numbers of accidents, will reduce both the number of traffic violations and the number and severity of accidents. The problem with the current analysis is its failure to account for the response time of the same vehicles that are required to deal with additional events to which they are called, such as accidents, obstacles reported on the road, congestion and other events. This research therefore discusses the application of the maximum covering location problem taking into account simultaneously 'hazardous locations', traffic volume and maximum coverage of the relevant sectors. The results of the model will enable improved coverage of the network that maximizes the traffic volume capture hence reducing response time to relevant events and improving police efficiency.
引用
收藏
页码:52 / 60
页数:9
相关论文
共 50 条
  • [21] Introducing the Dynamic Customer Location-Allocation Problem
    Ankrah, Reginald
    Lacroix, Benjamin
    McCall, John
    Hardwick, Andrew
    Conway, Anthony
    [J]. 2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3157 - 3164
  • [22] A DECOMPOSITION ALGORITHM FOR A DISCRETE LOCATION-ALLOCATION PROBLEM
    SHERALI, HD
    ADAMS, WP
    [J]. OPERATIONS RESEARCH, 1984, 32 (04) : 878 - 900
  • [23] Hybrid algorithms for the uncapacitated continuous location-allocation problem
    Mohammad Saeed Jabalameli
    Abdolsalam Ghaderi
    [J]. The International Journal of Advanced Manufacturing Technology, 2008, 37 : 202 - 209
  • [24] New stochastic models for capacitated location-allocation problem
    Zhou, J
    Liu, BD
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2003, 45 (01) : 111 - 125
  • [25] Hybrid evolutionary method for capacitated location-allocation problem
    Gong, DJ
    Gen, M
    Yamazaki, G
    Xu, WX
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 33 (3-4) : 577 - 580
  • [26] Construction Line Algorithms for the Connection Location-Allocation Problem
    Bischoff, Martin
    Bayer, Yvonne
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2007, 2008, : 345 - 350
  • [27] EFFICIENT ALGORITHM FOR SOLVING THE RECTILINEAR LOCATION-ALLOCATION PROBLEM
    BABICH, G
    [J]. ENVIRONMENT AND PLANNING A, 1978, 10 (12) : 1387 - 1395
  • [28] Waiting Time Costs in a Bilevel Location-Allocation Problem
    Mallozzi, Lina
    D'Amato, Egidio
    Daniele, Elia
    Petrone, Giovanni
    [J]. CONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL V, 2012, 5 : 178 - 188
  • [29] THE LOCATION-ALLOCATION PROBLEM USING MULTI-OBJECTIVES
    MITRA, A
    FORTENBERRY, JC
    [J]. ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1986, 10 (02): : 113 - 120
  • [30] Modeling capacitated location-allocation problem with fuzzy demands
    Zhou, Jian
    Liu, Baoding
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (03) : 454 - 468