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

Zarandi, M. H. Fazel, Davari, Soheil and Sisakht, S. A. Haddad 2012. The Q-coverage multiple allocation hub covering problem with mandatory dispersion. Scientia Iranica 19 (3) , pp. 902-911. 10.1016/j.scient.2012.03.007

Full text not available from this repository.

Abstract

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 QQ 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)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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Elsevier
ISSN:	1026-3098
Last Modified:	20 Jul 2017 04:03
URI:	https://orca.cardiff.ac.uk/id/eprint/68531

Citation Data

Cited 20 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item