On branch and cut approach for q-Allocation Hub Interdiction Problem
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 -allocation hub interdiction problem. In previous literature hub interdiction problem was studied with single and multiple allocation protocols.This problem focus on 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.
Cite
@article{arxiv.2408.03258,
title = {On branch and cut approach for q-Allocation Hub Interdiction Problem},
author = {Saikat Mukherjee and Prasanna Ramamoorthy and Navneet Vidyarthi},
journal= {arXiv preprint arXiv:2408.03258},
year = {2024}
}
Comments
There are some technical errors in the paper. The pareto section is not right and computational results are missing