We address the problem of dynamic patrol routing for state troopers for effective coverage of highways. Specifically, we model a fixed number of state troopers, starting their routes at patrolling critical locations with high crash frequencies and ending their shift at other (or the same) temporary stations so the starting points for the next period are also optimized. The temporary stations are selected from a given set of potential locations. The problem, therefore, is a multi-period dynamic location-routing problem in the context of public service. Our objective is to maximize the critical location coverage benefit while minimizing the costs of temporary station selections, vehicle utilizations, and routing/travel. We formulate the problem as a mixed integer linear programming model and solve it using both off-the-shelf optimization software and custom-built on the decomposition of location and routing problems. By allowing starting from multiple locations, the models improve the coverage as much as 10% compared to the coverage models forced to start from a single depot.
Bi-Criteria Dynamic Location-Routing Problem for Patrol Coverage
2012
37 pages
Report
Keine Angabe
Englisch
A patrol routing problem for maritime Crime-Fighting
Elsevier | 2022
|Analysis of an integrated maximum covering and patrol routing problem
Elsevier | 2011
|Analysis of an integrated maximum covering and patrol routing problem
Online Contents | 2012
|