Closest Assignment Constraints for Hub Disruption Problems

Supply chains and logistics can be well represented with hub networks. Operations of these hubs can be disrupted due to unanticipated occurrences or attacks. This study includes Closest assignment Constraints related to hub disruption problems, which can be used in single-level reformulation of the bilevel model. In this study, We propose new sets of constraints for closer assignments of non-hub nodes to hub nodes. We analysis those alternate sets of constraints and present the dominance relations among them. Experiment results show that the effectiveness of constraints can enhance tightness of models. Finally, We present a case study based on bicycle network.

Article

Download

View PDF