Analysis of an integrated maximum covering and patrol routing problem

2012 ◽  
Vol 48 (1) ◽  
pp. 215-232 ◽  
Author(s):  
Burcu B. Keskin ◽  
Shirley (Rong) Li ◽  
Dana Steil ◽  
Sarah Spiller
Keyword(s):  
Routing Problem ◽  
Patrol Routing

scholarly journals Analysing the Police Patrol Routing Problem: A Review

2020 ◽  
Vol 9 (3) ◽  
pp. 157 ◽  
Author(s):  
Maite Dewinter ◽  
Christophe Vandeviver ◽  
Tom Vander Beken ◽  
Frank Witlox
Keyword(s):  
Police Officers ◽  
Keyword Search ◽  
Hybrid Genetic Algorithm ◽  
Dynamic Vehicle Routing ◽  
Routing Problem ◽  
Police Patrol ◽  
Starting Point ◽  
Solution Methods ◽  
Routing Policies ◽  
Patrol Routing

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.

An improved formulation for the maximum coverage patrol routing problem

2015 ◽  
Vol 59 ◽  
pp. 1-10 ◽  
Author(s):  
İbrahim Çapar ◽  
Burcu B. Keskin ◽  
Paul A. Rubin
Keyword(s):  
Routing Problem ◽  
Maximum Coverage ◽  
Patrol Routing

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document