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

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.