Loading...

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

Fazel Zarandi, M. H ; Sharif University of Technology | 2012

480 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.scient.2012.03.007
  3. Publisher: 2012
  4. Abstract:
  5. 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
  6. Keywords:
  7. Hub covering problem ; Backup coverage ; Covering problems ; Hub location ; Multiple allocation ; Engineering ; Dispersions ; Data set ; Dispersion ; Experimental study ; Network design ; Numerical model
  8. Source: Scientia Iranica ; Volume 19, Issue 3 , 2012 , Pages 902-911 ; 10263098 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S1026309812000880