An improved formulation for the maximum coverage patrol routing problem

• Published in: Computers & operations research Vol. 59; pp. 1 - 10
• Main Authors: Çapar, İbrahim, Keskin, Burcu B., Rubin, Paul A.
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.07.2015; Pergamon Press Inc
• Subjects: Availability; Formulations; Highways; Integer programming; Mathematical models; Mathematical problems; Mixed integer; Mixed integer linear program; Optimization; Patrols; Resource allocation; Route choice; Routing; Studies; Traffic police; Mixed integer linear program; Routing; Resource allocation
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2014.12.002

We present an improved formulation for the maximum coverage patrol routing problem (MCPRP). The main goal of the patrol routing problem is to maximize the coverage of critical highway stretches while ensuring the feasibility of routes and considering the availability of resources. By investigating the structural properties of the optimal solution, we formulate a new, improved mixed integer program that can solve real life instances to optimality within seconds, where methods proposed in prior literature fail to find a provably optimal solution within an hour. The improved formulation provides enhanced highway coverage for both randomly generated and real life instances. We show an average increase in coverage of nearly 20% for the randomly generated instances provided in the literature, with a best case increase over 46%. Similarly, for the real life instances, we close the optimality gap within seconds and demonstrate an additional coverage of over 13% in the best case. The improved formulation also allows for testing a number of real life scenarios related to multi-start routes, delayed starts at the beginning of the shifts, and taking a planned break during the shift. Being able to solve these scenarios in short durations help decision and policy makers to better evaluate resource allocation options while serving public.