Complete and Incomplete Hierarchical Hub Center Network Problem with Single Assignment

Doostmohammadi, Mohammad

doi:10.22034/ijiems.2023.299142.1045

Complete and Incomplete Hierarchical Hub Center Network Problem with Single Assignment

Document Type : Original Article

Author

Mohammad Doostmohammadi

ICT Research Institute

10.22034/ijiems.2023.299142.1045

Abstract

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels are consisted of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. Also we are modeling this problem in incomplete network environment. In this case, the top level consists of an incomplete network where a direct link between all central hubs is not necessary and an incomplete network may lead to having lower transportation costs. We propose mixed integer programming model for these problems and conduct a computational study for these two developed models by using the CAB data.
Hubs are facilities that used to consolidate and disseminate flow and serve as points for switching, transshipment and sorting flows in many-to-many distribution systems. In practice, the use of hubs can result in lower network costs, but it can be shifting to determine where hubs should be located or how demands should be allocated to them.

Keywords

CAB Data

Modeling

MIP Formulation