Highlights ► We determine state trooper routes to visit historically critical hot spots. ► Routes maximize the number of hot spots covered and coverage duration. ► Routes are built using local- and tabu-search based heuristics. ► We introduce effective patrolling measures: coverage time and hot spot count. ► Results help determine the optimal number of routes needed for the best coverage.

    Abstract In this paper, we address the problem of determining the patrol routes of state troopers for maximum coverage of highway spots with high frequencies of crashes (hot spots). We develop a specific mixed integer linear programming model for this problem under time feasibility and budget limitation. We solve this model using local and tabu-search based heuristics. Via extensive computational experiments using randomly generated data, we test the validity of our solution approaches. Furthermore, using real data from the state of Alabama, we provide recommendations for (i) critical levels of coverage; (ii) factors influencing the service measures; and (iii) dynamic changes in routes.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Analysis of an integrated maximum covering and patrol routing problem


    Contributors:


    Publication date :

    2011-06-16


    Size :

    18 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Analysing the police patrol routing problem : a review

    Dewinter, Maite / Vandeviver, Christophe / Vander Beken, Tom et al. | BASE | 2020

    Free access

    A patrol routing problem for maritime Crime-Fighting

    Chen, Xinyuan / Wu, Shining / Liu, Yannick et al. | Elsevier | 2022