abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

Hub location problem (HLP) is one of the most important problems in the areas of logistics and telecommunication network design. In this paper we address the bi-objective non-strict single allocation hub location problem (BONSSAHLP). The non-strict property of this problem which allows establishment of direct links between pairs of non-hub nodes makes it somehow different from the conventional ...

This paper considers the discrete two-hub location problem. We need to choose two hubs from a set of nodes. The remaining nodes are to be connected to one of the two hubs which act as switching points for intemodal flows. A configuration which minimizes the total flow cost needs to be found. We show that the problem can be solved in polynomial dme when the hub locations are fixed. Since there a...

In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...

The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...

Abstract: Hub location problem is one of the most important problems in the areas of logistics and telecommunication network design. In this paper, we address the single allocation maximal covering hub location problem in which the objective is to maximise the amount of covered flows associated with origin-destination pairs in a hub-and-spoke network using a fixed number of hub facilities. Two ...