The hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. This paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. This formulation with incorpor...

This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...

The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...

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

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

hub location-allocation problems are currently a subject of keen interest in the research community. however, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. in this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....