The Q-coverage multiple allocation hub covering problem with mandatory dispersion

Citations of this article
Mendeley users who have this article in their library.


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. Production and hosting by Elsevier B.V. All rights reserved.




Fazel Zarandi, M. H., Davari, S., & Haddad Sisakht, S. A. (2012). The Q-coverage multiple allocation hub covering problem with mandatory dispersion. Scientia Iranica, 19(3), 902–911.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free