Scalable randomized patrolling for securing rapid transit networks
Mass Rapid Transit using rail is a popular mode of transport employed by millions of people in many urban cities across the world. Typically, these networks are massive, used by many and thus, can be a soft target for criminals. In this paper, we consider the problem of scheduling randomised patrols...
Saved in:
Main Authors: | VARAKANTHAM, Pradeep, LAU, Hoong Chuin, YUAN, Zhi |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2013
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1812 https://ink.library.smu.edu.sg/context/sis_research/article/2811/viewcontent/VarakanthamIAAI13.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
The patrol scheduling problem
by: LAU, Hoong Chuin, et al.
Published: (2012) -
Patrol Scheduling in an Urban Rail Network
by: LAU, Hoong Chuin, et al.
Published: (2016) -
Towards finding robust execution strategies for RCPSP/max with durational uncertainty
by: FU, Na, et al.
Published: (2010) -
DIRECT: A scalable approach for route guidance in Selfish Orienteering Problems
by: VARAKANTHAM, Pradeep, et al.
Published: (2015) -
Robust Local Search for Solving RCPSP/max with Durational Uncertainty
by: FU, Na, et al.
Published: (2012)