IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v69y2020ics0038012117302422.html
   My bibliography  Save this article

A Markov Decision Process approach for balancing intelligence and interdiction operations in city-level drug trafficking enforcement

Author

Listed:
  • Baycik, N. Orkun
  • Sharkey, Thomas C.
  • Rainwater, Chase E.

Abstract

We study a resource allocation problem in which law enforcement aims to balance intelligence and interdiction decisions to fight against illegal city-level drug trafficking. We propose a Markov Decision Process framework, apply a column generation technique, and develop a heuristic to solve this problem. Our approaches provide insights into how law enforcement should prioritize its actions when there are multiple criminals of different types known to them. We prove that when only one action can be implemented, law enforcement will take action (either target or arrest) on the highest known criminal type to them. Our results demonstrate that: (i) it may be valuable to diversify the action taken on the same criminal type when more than one action can be implemented; (ii) the marginal improvement in terms of the value of the criminals interdicted per unit time by increasing available resources decreases as resource level increases; and (iii) there are losses that arise from not holistically planning the actions of all available resources across distinct operations against drug trafficking networks.

Suggested Citation

  • Baycik, N. Orkun & Sharkey, Thomas C. & Rainwater, Chase E., 2020. "A Markov Decision Process approach for balancing intelligence and interdiction operations in city-level drug trafficking enforcement," Socio-Economic Planning Sciences, Elsevier, vol. 69(C).
    • Handle: RePEc:eee:soceps:v:69:y:2020:i:c:s0038012117302422
    DOI: 10.1016/j.seps.2019.03.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012117302422
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2019.03.006?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. Nail Orkun Baycik & Thomas C. Sharkey & Chase E. Rainwater, 2018. "Interdicting layered physical and information flow networks," IISE Transactions, Taylor & Francis Journals, vol. 50(4), pages 316-331, April.
    2. Joseph B. Kadane, 1971. "Optimal Whereabouts Search," Operations Research, INFORMS, vol. 19(4), pages 894-904, August.
    3. Michael Atkinson & Moshe Kress & Rutger-Jan Lange, 2016. "When Is Information Sufficient for Action? Search with Unreliable yet Informative Intelligence," Operations Research, INFORMS, vol. 64(2), pages 315-328, April.
    4. Ajay Malaviya & Chase Rainwater & Thomas Sharkey, 2012. "Multi-period network interdiction problems with applications to city-level drug enforcement," IISE Transactions, Taylor & Francis Journals, vol. 44(5), pages 368-380.
    5. Hiroyuki Sato & Johannes O. Royset, 2010. "Path optimization for the resource‐constrained searcher," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(5), pages 422-440, August.
    6. Laura A. McLay & Adrian J. Lee & Sheldon H. Jacobson, 2010. "Risk-Based Policies for Airport Security Checkpoint Screening," Transportation Science, INFORMS, vol. 44(3), pages 333-349, August.
    7. Moshe Kress & Kyle Lin & Roberto Szechtman, 2008. "Optimal discrete search with imperfect specificity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 539-549, December.
    8. Gino J. Lim & Sumeet S. Desai, 2010. "Markov decision process approach for multiple objective hazardous material transportation route selection problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(4), pages 506-529.
    9. Richard Wollmer, 1964. "Removing Arcs from a Network," Operations Research, INFORMS, vol. 12(6), pages 934-940, December.
    10. Lawrence D. Stone & Joseph B. Kadane, 1981. "Optimal Whereabouts Search for a Moving Target," Operations Research, INFORMS, vol. 29(6), pages 1154-1166, December.
    11. Kress, M. & Royset, J.O. & Rozen, N., 2012. "The eye and the fist: Optimizing search and interdiction," European Journal of Operational Research, Elsevier, vol. 220(2), pages 550-558.
    12. Alan R. Washburn, 1983. "Search for a Moving Target: The FAB Algorithm," Operations Research, INFORMS, vol. 31(4), pages 739-751, August.
    13. Wilson, Kurt E. & Szechtman, Roberto & Atkinson, Michael P., 2011. "A sequential perspective on searching for static targets," European Journal of Operational Research, Elsevier, vol. 215(1), pages 218-226, November.
    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. Liberatore, Federico & Camacho-Collados, Miguel & Quijano-Sánchez, Lara, 2023. "Towards social fairness in smart policing: Leveraging territorial, racial, and workload fairness in the police districting problem," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).

    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. Michael Atkinson & Moshe Kress & Rutger-Jan Lange, 2016. "When Is Information Sufficient for Action? Search with Unreliable yet Informative Intelligence," Operations Research, INFORMS, vol. 64(2), pages 315-328, April.
    2. Shen, Yeming & Sharkey, Thomas C. & Szymanski, Boleslaw K. & Wallace, William (Al), 2021. "Interdicting interdependent contraband smuggling, money and money laundering networks," Socio-Economic Planning Sciences, Elsevier, vol. 78(C).
    3. Jabarzare, Ziba & Zolfagharinia, Hossein & Najafi, Mehdi, 2020. "Dynamic interdiction networks with applications in illicit supply chains," Omega, Elsevier, vol. 96(C).
    4. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
    5. Joseph B. Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    6. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    7. Joseph Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    8. Tezcan, Barış & Maass, Kayse Lee, 2023. "Human trafficking interdiction with decision dependent success," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    9. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
    10. Jake Clarkson & Kevin D. Glazebrook & Kyle Y. Lin, 2020. "Fast or Slow: Search in Discrete Locations with Two Search Modes," Operations Research, INFORMS, vol. 68(2), pages 552-571, March.
    11. Keskin, Burcu B. & Griffin, Emily C. & Prell, Jonathan O. & Dilkina, Bistra & Ferber, Aaron & MacDonald, John & Hilend, Rowan & Griffis, Stanley & Gore, Meredith L., 2023. "Quantitative Investigation of Wildlife Trafficking Supply Chains: A Review," Omega, Elsevier, vol. 115(C).
    12. Yan, Xihong & Ren, Xiaorong & Nie, Xiaofeng, 2022. "A budget allocation model for domestic airport network protection," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    13. Kosmas, Daniel & Sharkey, Thomas C. & Mitchell, John E. & Maass, Kayse Lee & Martin, Lauren, 2023. "Interdicting restructuring networks with applications in illicit trafficking," European Journal of Operational Research, Elsevier, vol. 308(2), pages 832-851.
    14. Enayaty-Ahangar, Forough & Rainwater, Chase E. & Sharkey, Thomas C., 2019. "A Logic-based Decomposition Approach for Multi-Period Network Interdiction Models," Omega, Elsevier, vol. 87(C), pages 71-85.
    15. Xiaodan Xie & Felipe Aros‐Vera, 2022. "An interdependent network interdiction model for disrupting sex trafficking networks," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2695-2713, June.
    16. Pourakbar, M. & Zuidwijk, R.A., 2018. "The role of customs in securing containerized global supply chains," European Journal of Operational Research, Elsevier, vol. 271(1), pages 331-340.
    17. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    18. Hiba Baroud & Jose E. Ramirez‐Marquez & Kash Barker & Claudio M. Rocco, 2014. "Stochastic Measures of Network Resilience: Applications to Waterway Commodity Flows," Risk Analysis, John Wiley & Sons, vol. 34(7), pages 1317-1335, July.
    19. Rocco S, Claudio M. & Ramirez-Marquez, José Emmanuel, 2009. "Deterministic network interdiction optimization via an evolutionary approach," Reliability Engineering and System Safety, Elsevier, vol. 94(2), pages 568-576.
    20. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.

    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:eee:soceps:v:69:y:2020:i:c:s0038012117302422. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .

    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.