Patrol Scheduling in an Urban Rail Network

• Main Authors: LAU, Hoong Chuin, YUAN, Zhi, GUNAWAN, Aldy
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: Patrol scheduling problem Preferences Mass rapid transit rail network Mathematical programming; Artificial Intelligence and Robotics; Asian Studies; Operations and Supply Chain Management; Transportation
• Online Access: https://ink.library.smu.edu.sg/sis_research/2527; https://ink.library.smu.edu.sg/context/sis_research/article/3527/viewcontent/auto_convert.pdf
• Institution: Singapore Management University

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.