Police patrol routing on network voronoi diagram

Authors:
Toyohide Watanabe;Masatoshi Takamiya
Affiliations:
Nagoya Industrial Science Research Institute, Seimeiyama, Chikusa-ku, Nagoya, Japan;Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Japan
Venue:
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Year:
2014

Citing 4
Cited 0

Road network monitoring: algorithms and a case study

Computers and Operations Research
Searching for close alternative plans

Autonomous Agents and Multi-Agent Systems
Monitoring minimum cost paths on road networks

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A statistical threat assessment

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.