TY - JOUR
T1 - The Q-coverage multiple allocation hub covering problem with mandatory dispersion
AU - Fazel Zarandi, Mohammad Hossein
AU - Davari, S.
AU - Haddad Sisakht, S.A.
N1 - cited By 16
PY - 2012
Y1 - 2012
N2 - This paper addresses the multiple allocation hub set-covering problem considering backup coverage and mandatory dispersion of hubs. In the context of this paper, it has been assumed that a flow is covered if there are at least Q possible routes to satisfy its demand within a time bound. Moreover, there is a lower limit for the distance between hubs in order to provide a degree of dispersion in the solution. Mathematical formulation of this problem is given, which has O(n2) variables and constraints. Computational experiments carried out on the well-known CAB dataset give useful insights concerning model behavior and its sensitivity to parameters. © 2012 Sharif University of Technology.
AB - This paper addresses the multiple allocation hub set-covering problem considering backup coverage and mandatory dispersion of hubs. In the context of this paper, it has been assumed that a flow is covered if there are at least Q possible routes to satisfy its demand within a time bound. Moreover, there is a lower limit for the distance between hubs in order to provide a degree of dispersion in the solution. Mathematical formulation of this problem is given, which has O(n2) variables and constraints. Computational experiments carried out on the well-known CAB dataset give useful insights concerning model behavior and its sensitivity to parameters. © 2012 Sharif University of Technology.
U2 - 10.1016/j.scient.2012.03.007
DO - 10.1016/j.scient.2012.03.007
M3 - Article
VL - 19
SP - 902
EP - 911
JO - Scientia Iranica
JF - Scientia Iranica
IS - 3
ER -