IDEAS home Printed from https://ideas.repec.org/a/spr/jtrsec/v11y2018i1d10.1007_s12198-018-0187-z.html
   My bibliography  Save this article

Urban rail patrolling: a game theoretic approach

Author

Listed:
  • Abdolmajid Yolmeh

    (Rutgers University)

  • Melike Baykal-Gürsoy

    (Rutgers University)

Abstract

Patrol scheduling is a critical operational decision in protecting urban rail networks against terrorist activities. Designing patrols to protect such systems poses many challenges that have not been comprehensively addressed in the literature of patrol scheduling so far. These challenges include strategic attackers, dynamically changing station occupancy levels and human resource related limitations. In this paper, we develop a game theoretic model for the problem of scheduling security teams to patrol an urban mass transit rail network. Our main objective is to minimize the expected potential damage caused by terrorist activities while observing scheduling constraints. We model this problem as a non-cooperative simultaneous move game between a defender and an attacker. We then develop column generation based algorithms to find a Nash equilibrium for this game. We also present a lower bound for the value of the game which can be used to terminate the column generation algorithm when a desired solution quality is reached. We then run computational experiments to investigate the efficiency of the proposed algorithms and to gain insight about the value of the patrolling game. Our results show the efficiency of the proposed algorithms. Finally, we present results for the case of a real urban rail network.

Suggested Citation

  • Abdolmajid Yolmeh & Melike Baykal-Gürsoy, 2018. "Urban rail patrolling: a game theoretic approach," Journal of Transportation Security, Springer, vol. 11(1), pages 23-40, June.
    • Handle: RePEc:spr:jtrsec:v:11:y:2018:i:1:d:10.1007_s12198-018-0187-z
    DOI: 10.1007/s12198-018-0187-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12198-018-0187-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12198-018-0187-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Jan M. Chaiken & Peter Dormont, 1978. "A Patrol Car Allocation Model: Capabilities and Algorithms," Management Science, INFORMS, vol. 24(12), pages 1291-1300, August.
    3. Jan M. Chaiken & Peter Dormont, 1978. "A Patrol Car Allocation Model: Background," Management Science, INFORMS, vol. 24(12), pages 1280-1290, August.
    4. Hoong Chuin Lau & Zhi Yuan & Aldy Gunawan, 2016. "Patrol scheduling in urban rail network," Annals of Operations Research, Springer, vol. 239(1), pages 317-342, April.
    5. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Alex Shvetsov & Svetlana Shvetsova & Valentin Aleksandrovich Kozyrev & Victor Aleksandrovich Spharov & Nikolay Mikhaylovich Sheremet, 2017. "The “car-bomb” as a terrorist tool at metro stations, railway terminals and airports," Journal of Transportation Security, Springer, vol. 10(1), pages 31-43, June.
    7. Kenneth Chelst, 1978. "An Algorithm for Deploying a Crime Directed (Tactical) Patrol Force," Management Science, INFORMS, vol. 24(12), pages 1314-1327, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bui, Thuy & Lidbetter, Thomas, 2023. "Optimal patrolling strategies for trees and complete networks," European Journal of Operational Research, Elsevier, vol. 311(2), pages 769-776.
    2. Abigail Luxton & Marin Marinov, 2020. "Terrorist Threat Mitigation Strategies for the Railways," Sustainability, MDPI, vol. 12(8), pages 1-21, April.
    3. Hunt, Kyle & Zhuang, Jun, 2024. "A review of attacker-defender games: Current state and paths forward," European Journal of Operational Research, Elsevier, vol. 313(2), pages 401-417.
    4. Abdolmajid Yolmeh & Melike Baykal-Gürsoy, 2019. "Two-Stage Invest–Defend Game: Balancing Strategic and Operational Decisions," Decision Analysis, INFORMS, vol. 16(1), pages 46-66, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sukanya Samanta & Goutam Sen & Soumya Kanti Ghosh, 2022. "A literature review on police patrolling problems," Annals of Operations Research, Springer, vol. 316(2), pages 1063-1106, September.
    2. Kyle Y. Lin & Michael P. Atkinson & Kevin D. Glazebrook, 2014. "Optimal patrol to uncover threats in time when detection is imperfect," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 557-576, December.
    3. Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
    4. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    5. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    6. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    7. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    8. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 516-543, February.
    9. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    10. Mohammad Abouei Mehrizi & Federico Corò & Emilio Cruciani & Gianlorenzo D’Angelo, 2022. "Election control through social influence with voters’ uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 635-669, August.
    11. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    12. Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du, 2023. "A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice," Journal of Global Optimization, Springer, vol. 85(1), pages 15-38, January.
    13. Emily M. Craparo & Mumtaz Karatas & Tobias U. Kuhn, 2017. "Sensor placement in active multistatic sonar networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 287-304, June.
    14. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    15. Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.
    16. Hongjie Guo & Jianzhong Li & Hong Gao, 2022. "Data source selection for approximate query," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2443-2459, November.
    17. Verma, Arvind, 1998. "The fractal dimension of policing," Journal of Criminal Justice, Elsevier, vol. 26(5), pages 425-435, September.
    18. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    19. repec:dgr:rugsom:99a17 is not listed on IDEAS
    20. Klages-Mundt, Ariah & Minca, Andreea, 2022. "Optimal intervention in economic networks using influence maximization methods," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1136-1148.
    21. Xin Chen & Qingqin Nong & Yan Feng & Yongchang Cao & Suning Gong & Qizhi Fang & Ker-I Ko, 2017. "Centralized and decentralized rumor blocking problems," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 314-329, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jtrsec:v:11:y:2018:i:1:d:10.1007_s12198-018-0187-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.