TY  - JOUR
T1  - Modeling Police Patrol Routing and its Problem-Solving Technique Based on the Ant Colony Optimization Algorithm(case Study: Iran’s Police)
AU - Ziaee Azimi, Seyed Ali AU - Bashiri, Mehdi 
JO  - Research Journal of Applied Sciences
VL  - 11
IS  - 7
SP  - 536
EP  - 546
PY  - 2016
DA  - 2001/08/19
SN  - 1815-932x
DO  - rjasci.2016.536.546
UR  - https://makhillpublications.co/view-article.php?doi=rjasci.2016.536.546
KW  - Stochastic Vehicle Routing Problem (SVRP)
KW  -ant colony optimization algorithm
KW  -police patrol
KW  -headways
KW  -police station
AB  - In light of the fact that crime prevention is of high importance on the issue of ensuring security within a community which is mostly carried out by police patrols of the police stations, making decisions on taking the best approach to plan and schedule police patrol routing may result in the increase in efficiency of these patrols. In this study, in order to reach an optimal solution to the police patrol routing problem and enhance the efficiency of the patrols, a routing model was proposed based on the stochastic approach to vehicle routing problem and by utilizing the graph theory and mathematical modeling approach. Then, the meta-heuristic ant colony optimization algorithm was utilized to find an efficient way of solving the model. After determining the police patrol routes taking into account the obtained optimized values for the objective functions, the suitable number of patrollers and headways (i.e. time interval between two patrols) was also determined.
ER  -