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

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

In this paper we consider an extended version of the classical capacitated single allocation hub location problem in which the size of the hubs must be chosen from a finite and discrete set of allowable capacities. We develop a Lagrangian relaxation approach that exploits the problem structure and decomposes the problem into a set of smaller subproblems that can be solved efficiently. Upper bou...

This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...

The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

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 consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. we model this problem in an incomplete net...

Hubs are critical elements of transportation networks. Location of hubs and allocation of demands to them are of high importance in the network design. The most important purpose of these models is to minimize the cost, but path reliability is also another important factor which can influence the location of hubs. In this paper, we propose a P-center hub location model with full interconnection...

In this paper the capacitated hub location problem is formulated by a minimax regret model, which takes into account uncertain setup cost and demand. We focus on hub location with multiple allocations as a strategic problem requiring one definite solution. Investigating how deterministic models may lead to sub-optimal solutions, we provide an efficient formulation method for the problem. A comp...

The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze an application separately, we observe that each area has its own characteristics. Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. This...

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 consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...