Drone patrol routing planning: application of new patrol mode

A Branch-and-Price Framework for the Maximum Covering and Patrol Routing Problem

Lecture Notes in Management and Industrial Engineering - Data and Decision Sciences in Action 2 ◽

10.1007/978-3-030-60135-5_5 ◽

2021 ◽

pp. 59-80

Author(s):

Paul A. Chircop ◽

Timothy J. Surendonk ◽

Menkes H. L. van den Briel ◽

Toby Walsh

Keyword(s):

Branch And Price ◽

Routing Problem ◽

Patrol Routing

Download Full-text

Development of an Intelligent Patrol Routing System Using GIS and Computer Simulations

Artificial Crime Analysis Systems ◽

10.4018/978-1-59904-591-7.ch017 ◽

2011 ◽

pp. 339-351 ◽

Cited By ~ 4

Author(s):

Joseph Szakas ◽

Christian Trefftz ◽

Raul Ramirez ◽

Eric Jefferis

Keyword(s):

Information System ◽

Real Time ◽

Data Sets ◽

Time Data ◽

Map Algebra ◽

Positioning Systems ◽

Global Positioning ◽

Real Time Data ◽

Patrol Routing ◽

Patrol Strategies

Patrolling in a nonrandom, but focused manner is an important activity in law enforcement. The use of geographic information systems, the emerging real-time data sets (spatial and nonspatial) and the ability via global positioning systems to identify locations of patrol units provide the environment to discuss the concept and requirements of an intelligent patrol routing system. This intelligent patrol routing system will combine available data utilizing Map Algebra and a data structure known as a Voronoi diagram to create a real-time updatable raster surface over the patrolling area to identify destination locations and routes for all patrol units. This information system will allow all patrol units to function “in concert” under a coordinated plan, and make good use of limited patrolling resources, and provide the means of evaluating current patrol strategies. This chapter discusses the algorithmic foundation, implications, requirements, and simulation of a GIS based intelligent patrol routing system.

Download Full-text

Applied BIM: AMT and MTSP Integrated Approach for the Interior Patrol Routing Problem

Computing in Civil Engineering 2017 ◽

10.1061/9780784480823.010 ◽

2017 ◽

Author(s):

Chun-Hao Chen ◽

Albert Y. Chen

Keyword(s):

Integrated Approach ◽

Routing Problem ◽

Patrol Routing

Download Full-text

Genetic Algorithm for Optimizing Routing Design and Fleet Allocation of Freeway Service Overlapping Patrol

Sustainability ◽

10.3390/su10114120 ◽

2018 ◽

Vol 10 (11) ◽

pp. 4120 ◽

Cited By ~ 6

Author(s):

Xiuqiao Sun ◽

Jian Wang ◽

Weitiao Wu ◽

Wenjia Liu

Keyword(s):

Genetic Algorithm ◽

Population Diversity ◽

Decision Makers ◽

Incident Response ◽

Matrix Encoding ◽

Routing Design ◽

Speed Up ◽

Fleet Allocation ◽

Patrol Routing ◽

Elitist Strategy

The freeway service patrol problem involves patrol routing design and fleet allocation on freeways that would help transportation agency decision-makers when developing a freeway service patrols program and/or altering existing route coverage and fleet allocation. Based on the actual patrol process, our model presents an overlapping patrol model and addresses patrol routing design and fleet allocation in a single integrated model. The objective is to minimize the overall average incident response time. Two strategies—overlapping patrol and non-overlapping patrol—are compared in our paper. Matrix encoding is applied in the genetic algorithm (GA), and to maintain population diversity and avoid premature convergence, a niche strategy is incorporated into the traditional genetic algorithm. Meanwhile, an elitist strategy is employed to speed up the convergence. Using numerical experiments conducted based on data from the Sioux Falls network, we clearly show that: overlapping patrol strategy is superior to non-overlapping patrol strategy; the GA outperforms the simulated annealing (SA) algorithm; and the computational efficiency can be improved when LINGO software is used to solve the problem of fleet allocation.

Download Full-text

Analysing the Police Patrol Routing Problem: A Review

ISPRS International Journal of Geo-Information ◽

10.3390/ijgi9030157 ◽

2020 ◽

Vol 9 (3) ◽

pp. 157 ◽

Cited By ~ 2

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.

Download Full-text