Analysing the Police Patrol Routing Problem: A Review (English)

  • Article (Journal)  /  Electronic Resource

How to get this document?

Police patrol is a complex process. While on patrol, police officers must balance many intersecting responsibilities. Most notably, police must proactively patrol and prevent offenders from committing crimes but must also reactively respond to real-time incidents. Efficient patrol strategies are crucial to manage scarce police resources and minimize emergency response times. The objective of this review paper is to discuss solution methods that can be used to solve the so-called police patrol routing problem (PPRP). The starting point of the review is the existing literature on the dynamic vehicle routing problem (DVRP). A keyword search resulted in 30 articles that focus on the DVRP with a link to police. Although the articles refer to policing, there is no specific focus on the PPRP; hence, there is a knowledge gap. A diversity of approaches is put forward ranging from more convenient solution methods such as a (hybrid) Genetic Algorithm (GA), linear programming and routing policies, to more complex Markov Decision Processes and Online Stochastic Combinatorial Optimization. Given the objectives, characteristics, advantages and limitations, the (hybrid) GA, routing policies and local search seem the most valuable solution methods for solving the PPRP.

  • Title:
    Analysing the Police Patrol Routing Problem: A Review
  • Author / Creator:
  • Year of publication:
  • Remarks:
    ISPRS International Journal of Geo-Information ; ISSN: 2220-9964
  • Type of media:
    Article (Journal)
  • Type of material:
    Electronic Resource
  • Language:
  • Classification:
    DDC:    510
  • Source:
  • Export: