Author:
Cheung Chun-Yin,Yoon H.T.,Chow Andy HF
Abstract
Purpose
– This paper aims to present an application of location optimization techniques for deploying police facilities subject to budgetary and feasibility constraints. The objectives considered included minimizing the distances and maximizing the coverage of police stations over potential crime spots.
Design/methodology/approach
– The optimization consists of two stages. In Stage 1, a minimum distance model is used to determine the locations of police stations. Given the locations of police stations, Stage 2 uses a maximum coverage model to determine the police patrol area. The framework is applied to a case in the Greater London Area. The authors also evaluate the resilience of the optimal solutions with the terrorist attack scenario on 7 July 2005 in Central London.
Findings
– With the optimization models, it is shown that the average distance between police stations and potential crime spots is reduced by 19 per cent. The coverage percentage of potential crime spots is also increased from the existing 91.99 per cent to a nearly perfect 99.82 per cent. Nevertheless, the results reveal that the optimal police resources deployment is less resilient with respect to the existing one. The findings herein suggest the importance of incorporating measures of resilience into the optimization framework and the authors leave this topic for further investigation.
Originality/value
– The study highlights the value of location optimization to police force deployment in terms of finding the optimal locations of police force with respect to the spatial distribution of crimes. In particular, the authors investigate its implication on urban resilience, which is among the first study of this kind.
Subject
Management of Technology and Innovation,Strategy and Management,Business and International Management
Reference30 articles.
1. Alp, O.
,
Erkut, E.
and
Drezner, Z.
(2003), “An efficient genetic algorithm for the p-median problem”,
Annals of Operations Research
, Vol. 122 Nos 1-4, pp. 21-42.
2. Aly, A.A.
and
Litwhiler, D.W.Jr
(1979), “Police briefing stations: a location problem”,
AIIE Transactions
, Vol. 11 No. 1, pp. 12-22.
3. Beasley, J.
(1998), “Lagrangean heuristics for location problems”,
European Journal of Operational Research
, Vol. 111 No. 3, pp. 423-447.
4. Berman, O.
,
Drezner, Z.
,
Krass, D.
and
Wesolowsky, G.O.
(2009), “The variable radius covering problem”,
European Journal of Operational Research
, Vol. 196 No. 2, pp. 516-525.
5. Berman, O.
and
Krass, D.
(2005), “An improved IP formulation for the uncapacitated facility location problem”,
Annals of Operations Research
, Vol. 136 No. 1, pp. 21-34.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献