Single Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
Subject Areas : International Journal of Industrial Mathematics
E. Korani
1
(Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran.)
A. R. Eydi
2
(Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran.)
I. Nakhai Kamalabadi
3
(Department of of Engineering, University of Kurdistan, Sanandaj, Iran.)
Keywords: Hub set covering, Hierarchical, Capacity constraint, Hub location,
Abstract :
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-destination pair within a given time bound.