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

This paper addresses the multiple allocation hub set-covering problem considering backupcoverage and mandatory dispersion of hubs. in the context of this paper, it has been assumed that a flowis 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 thesolution. 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 concerningmodel behavior and its sensitivity to parameters.