Conference Proceeding Article
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 at varying time periods of the network subject to rostering as well as security-related constraints. We present a mathematical programming model for this problem. We then discuss the aspect of injecting randomness by varying the start times, the break times for each team as well as the number of visits required 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 | Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering | Transportation
Intelligent Systems and Decision Analytics
Practice and Theory of Automated Timetabling (PATAT 2012): 29-31 August: Proceedings
City or Country
LAU, Hoong Chuin and GUNAWAN, Aldy.
The patrol scheduling problem. (2012). Practice and Theory of Automated Timetabling (PATAT 2012): 29-31 August: Proceedings. 175-162. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3374
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.