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.
Patrol scheduling problem Preferences Mass rapid transit rail network Mathematical programming
Artificial Intelligence and Robotics | Asian Studies | Operations and Supply Chain Management | Transportation
Intelligent Systems and Decision Analytics
Annals of Operations Research
LAU, Hoong Chuin; YUAN, Zhi; and GUNAWAN, Aldy.
Patrol Scheduling in an Urban Rail Network. (2016). Annals of Operations Research. 239, (1), 317-342. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2527
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.