Single ‎A‎ssignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks

الموضوعات : مجله بین المللی ریاضیات صنعتی

E. Korani ¹ , A. R. Eydi ² , I. Nakhai Kamalabadi ³

1 - Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran.
2 - Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran.
3 - Department of of Engineering, University of Kurdistan, Sanandaj, Iran.

تاريخ الإرسال : 17 السبت , محرم, 1439 تاريخ التأكيد : 01 السبت , محرم, 1441 تاريخ الإصدار : 04 الأحد , ربيع الثاني, 1441

الکلمات المفتاحية: Hub set covering, Hierarchical, Capacity constraint, Hub location,

ملخص المقالة :

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.