Multi-period network interdiction problems with applications to city-level drug enforcement

Ajay Malaviya, Chase Rainwater and Thomas Sharkey

IISE Transactions, 2012, vol. 44, issue 5, 368-380

Abstract: This article considers a new class of multi-period network interdiction problems that focus on scheduling the activities of law enforcement in order to successfully interdict criminals in an illegal drug supply chain. This class of problems possesses several novel features for interdiction problems that were motivated through collaborations with city-level drug enforcement officials. These features include modeling the temporal aspects of these interdictions and the requirements associated with building interdictions in order to arrest high-ranking criminals in the drug supply chain. Based on these collaborations a systematic procedure is developed to generate realistic test instances of the multi-period network interdiction problem. Computational analysis on these realistic test instances provides some direction to the policies that law enforcement should implement in their interdiction activities.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2011.602659 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:44:y:2012:i:5:p:368-380

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2011.602659

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().