A Logic-based Decomposition Approach for Multi-Period Network Interdiction Models

Forough Enayaty-Ahangar, Chase E. Rainwater and Thomas C. Sharkey

Omega, 2019, vol. 87, issue C, 71-85

Abstract: This research details the creation of a large-scale optimization approach for solving an application of a multi-period bilevel network interdiction problem (NIP). In this class of multi-period NIP, interdiction activities must be scheduled to minimize the cumulative maximum flow over a finite time horizon. A logic-based decomposition (LBD) approach is proposed that utilizes constraint programming to exploit the scheduling nature of this multi-period NIP. Computational results–comparing solutions obtained using the proposed approach versus traditional mixed-integer programming approach–suggest that the LBD approach is more efficient in finding solutions for medium to large problem instances.

Keywords: Large-scale optimization; Scheduling; Multi-period Network Interdiction; Maximum Flow Problem; Decomposition Approach; Constraint Programming (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048318300422
Full text for ScienceDirect subscribers only

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:eee:jomega:v:87:y:2019:i:c:p:71-85

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2018.08.006

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().