Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 738578, 13 pages
http://dx.doi.org/10.1155/2015/738578
Research Article

Configuration, Deployment, and Scheduling Models for Management and Optimization of Patrol Services

Logistics Research Center, Shanghai Maritime University, Shanghai 200135, China

Received 30 September 2014; Revised 15 November 2014; Accepted 27 November 2014

Academic Editor: Kishin Sadarangani

Copyright © 2015 Bin Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Reis, A. Melo, A. L. V. Coelho, and V. Furtado, “Towards optimal police patrol routes with genetic algorithms,” in Intelligence and Security Informatics, vol. 3975 of Lecture Notes in Computer Science, pp. 485–491, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  2. R. T. Coupe and L. Blake, “The effects of patrol workloads and response strength on arrests at burglary emergencies,” Journal of Criminal Justice, vol. 33, no. 3, pp. 239–255, 2005. View at Publisher · View at Google Scholar · View at Scopus
  3. S. J. D'Amico, S.-J. Wang, R. Batta, and C. M. Rump, “A simulated annealing approach to police district design,” Computers and Operations Research, vol. 29, no. 6, pp. 667–684, 2002. View at Publisher · View at Google Scholar · View at Scopus
  4. H. C. W. Lau, G. T. S. Ho, Y. Zhao, and W. T. Hon, “Optimizing patrol force deployment using a genetic algorithm,” Expert Systems with Applications, vol. 37, no. 12, pp. 8148–8154, 2010. View at Publisher · View at Google Scholar · View at Scopus
  5. Y. Lou, Y. Yin, and S. Lawphongpanich, “Freeway service patrol deployment planning for incident management and congestion mitigation,” Transportation Research C: Emerging Technologies, vol. 19, no. 2, pp. 283–295, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. B. B. Keskin, S. R. Li, D. Steil, and S. Spiller, “Analysis of an integrated maximum covering and patrol routing problem,” Transportation Research E: Logistics and Transportation Review, vol. 48, no. 1, pp. 215–232, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. Y. Yin, “Optimal fleet allocation of freeway service patrols,” Networks and Spatial Economics, vol. 6, no. 3-4, pp. 221–234, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. Y. Yin, “A scenario-based model for fleet allocation of freeway service patrols,” Networks and Spatial Economics, vol. 8, no. 4, pp. 407–417, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. R. Pal and K. C. Sinha, “Simulation model for evaluating and improving effectiveness of freeway service patrol programs,” Journal of Transportation Engineering, vol. 128, no. 4, pp. 355–365, 2002. View at Publisher · View at Google Scholar · View at Scopus
  10. S. E. Bodily, “Police sector design incorporating preferences of interest groups for equality and efficiency,” Management Science, vol. 24, no. 12, pp. 1301–1313, 1978. View at Publisher · View at Google Scholar
  11. J. M. Carroll and P. G. Laurin, “Using simulation to assign police patrol zones,” Simulation, vol. 36, no. 1, pp. 1–12, 1981. View at Publisher · View at Google Scholar · View at Scopus
  12. G. M. Kern, “Computer simulation model for the study of police patrol deployment,” Simulation, vol. 52, no. 6, pp. 226–232, 1989. View at Publisher · View at Google Scholar · View at Scopus
  13. K. M. Curtin, K. Hayslett-McCall, and F. Qiu, “Determining optimal police patrol areas with maximal covering and backup covering location models,” Networks and Spatial Economics, vol. 10, no. 1, pp. 125–145, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. T. Assunção and V. Furtado, “A heuristic method for balanced graph partitioning: an application for the demarcation of preventive police patrol areas,” in Advances in Artificial Intelligence—IBERAMIA 2008, vol. 5290 of Lecture Notes in Computer Science, pp. 62–72, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  15. A. Khattak, N. Rouphail, K. Monast, and J. Havel, “Method for priority-ranking and expanding freeway service patrols,” Transportation Research Record, vol. 1867, pp. 1–10, 2004. View at Google Scholar · View at Scopus
  16. J. M. Chaiken and P. Dormont, “A patrol car allocation model: background,” Management Science, vol. 24, no. 12, pp. 1280–1290, 1978. View at Publisher · View at Google Scholar
  17. J. M. Chaiken and P. Dormont, “A patrol car allocation model: capabilities and algorithms,” Management Science, vol. 24, no. 12, pp. 1291–1300, 1978. View at Publisher · View at Google Scholar
  18. L. C. Green and P. J. Kolesar, “A comparison of the multiple dispatch and M/M/c priority queueing models of police patrol,” Management Science, vol. 30, no. 6, pp. 665–670, 1984. View at Publisher · View at Google Scholar · View at Scopus
  19. L. V. Green and P. J. Kolesar, “Testing the validity of a queueing model of police patrol,” Management Science, vol. 35, no. 2, pp. 127–148, 1989. View at Publisher · View at Google Scholar
  20. S. R. Sacks, “Optimal spatial deployment of police patrol cars,” Social Science Computer Review, vol. 18, no. 1, pp. 40–45, 2000. View at Google Scholar · View at Scopus