Journal
IIE TRANSACTIONS
Volume 44, Issue 5, Pages 368-380Publisher
TAYLOR & FRANCIS INC
DOI: 10.1080/0740817X.2011.602659
Keywords
Dynamic network interdiction; scheduling; drug enforcement; policy-based analysis; maximum flows
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available