Police patrol routing on network voronoi diagram
Toyohide Watanabe, Masatoshi Takamiya · 2014
Since road network is huge and complex, a task of planning police patrol routes by hand is hard work. In addition, it is necessary to update timely the already-planned routes in order to successively deal with unanticipated situations such as emergency calls and traffic jams. In this paper, we propose a method for optimizing the patrol routes, using the local search technique based on Network Voronoi Diagram. The routes are repeatedly optimized by means of local search technique so as to shorten the total response time. In order to transform the routes in consideration of the carrying frequency, our idea is to preferentially insert edges, which have high carrying frequency, into the route attached with the priority queue.