Hub Arc Covering Location Problem under Disruption

Hub networks are among the important variations of transportation networks that have applications in air transportation, post, and telecommunication. An important feature of these networks is the possibility of disruption in the network performance due to failure of hub facilities or access links. In this study, the hub arc covering location problem is studied under disruption of hub arcs. First a new mathematical model is introduced based on the chance-constrained programming technique in stochastic programming. Then computational results of solving the proposed model for problem instance (based on Iran Aviation Data and Australian Post) are presented. The computational results confirmed the importance of disruption consideration before designing hub networks and changes in the optimal configuration of the network under disruption.