Towards optimal police patrol routes with genetic algorithms

30Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is quite consensual that police patrolling can be regarded as one of the best well-known practices for implementing public-safety preventive policies towards the combat of an assortment of urban crimes. However, the specification of successful police patrol routes is by no means a trivial task to pursue, mainly when one considers large demographic areas, In this work, we present the first results achieved with GAPatrol, a novel evolutionary multiagent-based simulation tool devised to assist police managers in the design of effective police patrol route strategies. One particular aspect investigated here relates to the GAPatrol's facility to automatically discover crime hotspots, that is, high-crime-density regions (or targets) that deserve to be better covered by routine patrol surveillance. In order to testify the potentialities of the novel approach in such regard, simulation results related to two scenarios of study over the same artificial urban territory are presented and discussed here. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Reis, D., Melo, A., Coelho, A. L. V., & Furtado, V. (2006). Towards optimal police patrol routes with genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3975 LNCS, pp. 485–491). Springer Verlag. https://doi.org/10.1007/11760146_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free