The design of non-strict single allocation hub networks

In this paper we consider the new problem of non-strict single allocation hub location (NSSAHLP), which may arise in many practical situations such as air transportation planning, telecommunication network design, etc. A novel integer programming formulation is presented to model the NSSAHLP. To show the validity of the proposed model, it is applied on a set of test problems with different parameter settings. The numerical results indicate that the total cost of the system may be reduced considerably when direct transportations between non-hub nodes are permissible in comparison to the case of strict hubbing policy