Publication Type

Journal Article

Version

Postprint

Publication Date

4-2016

Abstract

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.

Keywords

Patrol scheduling problem Preferences Mass rapid transit rail network Mathematical programming

Discipline

Artificial Intelligence and Robotics | Asian Studies | Operations and Supply Chain Management | Transportation

Research Areas

Intelligent Systems and Decision Analytics

Publication

Annals of Operations Research

Volume

239

Issue

1

First Page

317

Last Page

342

ISSN

0254-5330

Identifier

10.1007/s10479-014-1648-9

Publisher

Springer Verlag

Copyright Owner and License

Authors

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1007/s10479-014-1648-9