A cooperative routing strategy for daily operations is necessary to maintain the effects of hotspot policing and to reduce crime and disorder. Existing robot patrol routing strategies are not suitable, as they omit the peculiarities and challenges of daily police patrol including minimising the average time lag between two consecutive visits to hotspots, as well as coordinating multiple patrollers and imparting unpredictability to patrol routes. In this research, we propose a set of guidelines for patrol routing strategies to meet the challenges of police patrol. Following these guidelines, we develop an innovative heuristic-based and Bayesian-inspired real-time strategy for cooperative routing police patrols. Using two real-world cases and a benchmark patrol strategy, an online agent-based simulation has been implemented to testify the efficiency, flexibility, scalability, unpredictability, and robustness of the proposed strategy and the usability of the proposed guidelines.


    Access

    Download


    Export, share and cite



    Title :

    Developing an online cooperative police patrol routing strategy


    Contributors:
    Wise, SC (author) / Chen, H (author) / Cheng, T (author)

    Publication date :

    2017-03-01


    Remarks:

    Computers, Environment and Urban Systems , 62 pp. 19-29. (2017)


    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Analysing the police patrol routing problem : a review

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

    Free access


    Intelligent police service patrol system

    ZHANG YUJIN / MA KE / HAN WEN | European Patent Office | 2022

    Free access

    An Optimal Police Patrol Planning Strategy for Smart City Safety

    Hochstetler, Jacob / Hochstetler, Lauren / Fu, Song | IEEE | 2016