Hubs are special centers that used for switching, transferring and handling freight or passengers in transportation systems. The hub location problem deals with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. Aiming at minimizing the total costs, maximizing utilization of transporters, maximizing the service level, etc....

We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuri...

hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is ...

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

in this study, a hierarchical hub location problem by considering different modes of transportation and maximum allowed delay is investigated. this study is done on iran’s express postal service with 2 days maximum delay in delivery considering ground and airport hubs. the problem is of the type of location and single allocation for collection, transfer and distribution of the shipments. all th...