IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v335y2024i2d10.1007_s10479-022-05087-3.html
   My bibliography  Save this article

Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks

Author

Listed:
  • Daniel Kosmas

    (Northeastern University)

  • Thomas C. Sharkey

    (Clemson University)

  • John E. Mitchell

    (Rensselaer Polytechnic Institute)

  • Kayse Lee Maass

    (Northeastern University)

  • Lauren Martin

    (University of Minnesota)

Abstract

We consider a new class of multi-period network interdiction problems, where interdiction and restructuring decisions are decided upon before the network is operated and implemented throughout the time horizon. We discuss how we apply this new problem to disrupting domestic sex trafficking networks, and introduce a variant where a second cooperating attacker has the ability to interdict victims and prevent the recruitment of prospective victims. This problem is modeled as a bilevel mixed integer linear program (BMILP), and is solved using column-and-constraint generation with partial information. We also simplify the BMILP when all interdictions are implemented before the network is operated. Modeling-based augmentations are proposed to significantly improve the solution time in a majority of instances tested. We apply our method to synthetic domestic sex trafficking networks, and discuss policy implications from our model. In particular, we show how preventing the recruitment of prospective victims may be as essential to disrupting sex trafficking as interdicting existing participants.

Suggested Citation

  • Daniel Kosmas & Thomas C. Sharkey & John E. Mitchell & Kayse Lee Maass & Lauren Martin, 2024. "Multi-period max flow network interdiction with restructuring for disrupting domestic sex trafficking networks," Annals of Operations Research, Springer, vol. 335(2), pages 797-860, April.
    • Handle: RePEc:spr:annopr:v:335:y:2024:i:2:d:10.1007_s10479-022-05087-3
    DOI: 10.1007/s10479-022-05087-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05087-3
    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/s10479-022-05087-3?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.

    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:annopr:v:335:y:2024:i:2:d:10.1007_s10479-022-05087-3. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.