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

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.

Keywords:

Hub location , Hub set covering , Hierarchical , Capacity constraint

Authors

E. Korani

Department of Industrial Engineering, University of Kurdistan, Sanandaj, ‎Iran‎.

A. R. Eydi

Department of Industrial Engineering, University of Kurdistan, Sanandaj, ‎Iran‎.

I. Nakhai Kamalabadi

Department of of Engineering, University of Kurdistan, Sanandaj, ‎Iran‎.

Certificate
من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

https://civilica.com/doc/1886998

شناسه ملی سند علمی:

JR_IJIM-11-4_008

تاریخ نمایه سازی: 26 دی 1402

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:

Korani, E. and Eydi, A. R. and Nakhai Kamalabadi, I.,1398,Single ‎A‎ssignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks,https://civilica.com/doc/1886998

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of University of Kurdistan

Type of center: دانشگاه دولتی

Paper count: 8,923

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.