Patrol scheduling in urban rail network

This paper presents the problem of scheduling security teams to patrol a mass rapid transit rail network of a large urban city. The main objective of patrol scheduling is to deploy security teams to stations of the network at varying time periods subject to rostering as well as security-related constraints. We present several mathematical programming models for different variants of this problem. To generate randomized schedules on a regular basis, we propose injecting randomness by varying the start time and break time for each team as well as varying the visit frequency and visit time for each station according to their reported vulnerability. Finally, we present results for the case of Singapore mass rapid transit rail network and synthetic instances.

[1]  Li Lin,et al.  Passenger grouping under constant threat probability in an airport security system , 2006, Eur. J. Oper. Res..

[2]  Kevin M. Curtin,et al.  Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models , 2010 .

[3]  Sanja Petrovic,et al.  Comparison of Algorithms for Nurse Rostering Problems , 2008 .

[4]  Debasis Ghosh,et al.  Lexicographic goal programming model for police patrol cars deployment in metropolitan cities , 2007 .

[5]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[6]  Christian Artigues,et al.  An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport , 2010, J. Heuristics.

[7]  Milind Tambe,et al.  Security and Game Theory: IRIS – A Tool for Strategic Security Allocation in Transportation Networks , 2011, AAMAS 2011.

[8]  Milind Tambe,et al.  Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems , 2012, AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health.

[9]  Zilla Sinuany-Stern,et al.  Multi-Objective Scheduling Plans for Security Guards , 1986 .

[10]  Jeffrey W. Herrmann Handbook of operations research for homeland security , 2013 .

[11]  Mario Vanhoucke,et al.  A Hybrid Scatter Search Heuristic for Personalized Crew Rostering in the Airline Industry , 2007 .

[12]  Philip E. Taylor,et al.  A Break from Tradition for the San Francisco Police: Patrol Officer Scheduling Using an Optimization-Based Decision Support System , 1989 .

[13]  Sydney C. K. Chu,et al.  Crew scheduling of light rail transit in Hong Kong: from modeling to implementation , 1998, Comput. Oper. Res..

[14]  Andrea L. Bertozzi,et al.  An “Estimate & Score Algorithm” for simultaneous parameter estimation and reconstruction of incomplete data on social networks , 2013, Security Informatics.

[15]  Zhi Yuan,et al.  Scalable Randomized Patrolling for Securing Rapid Transit Networks , 2013, IAAI.

[16]  Hoong Chuin Lau,et al.  Master physician scheduling problem , 2013, J. Oper. Res. Soc..

[17]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[18]  Yue Zhang,et al.  Police patrol districting method and simulation evaluation using agent-based model & GIS , 2013, Security Informatics.

[19]  Milind Tambe,et al.  Deployed Security Games for Patrol Planning , 2013 .

[20]  Matthew Rosenshine,et al.  Contributions to a Theory of Patrol Scheduling , 1970 .

[21]  Manish Jain,et al.  Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service , 2010, Interfaces.