On branch and cut approach for q-Allocation Hub Interdiction Problem

TL;DR

This paper investigates a bilevel q-allocation hub interdiction problem in logistics networks, enhancing branch-and-cut methods with cutting planes to efficiently solve large instances and address previous computational challenges.

Contribution

It introduces an improved branch-and-cut approach for the q-allocation hub interdiction problem, extending prior work to handle more complex allocation scenarios.

Findings

Efficiently solves large, previously unsolvable instances.

Demonstrates the effectiveness of cutting planes in the branch-and-cut method.

Provides new insights into hub interdiction under q-allocation protocols.

Abstract

Many industries widely adopted hub networks these days. Managing logistics, transportation, and distribution requires a delicate balance to ensure seamless operations within this network. Hub network promotes cost-effective routing through inter-hub flows. Failure of such hubs may impact the total network with huge costs. In this paper, we study bilevel $q$-allocation hub interdiction problem. In previous literature hub interdiction problem was studied with single and multiple allocation protocols.This problem focus on $q$ allocation which solves single and multiple allocation problem as special case. We also show improvements on the branch and cut approach by using cutting planes.Our experiments based on large instances present the efficiency of the approach to solve some previously unsolved instances.