Transportation networks frequently employ hub-and-spoke network architectures to route flows between many origin and destination pairs. In this paper, we deal with a problem, called the single allocation hub-and-spoke network design problem. In the single allocation hub-andspoke network design problem, the goal is to allocate each non-hub node to exactly one of given hub nodes so as to minimize...

The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing ...

In hub-and-spoke systems, due to the changes in input parameters affecting system over time, transportation providers should make right and timely decisions about hub facilities. For this reason, multi-period location problems are especially important. This paper presents a comprehensive review of from 1990 up most recent published studies. First, we study developed models based on some charact...

We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Cent...

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

In this study a hierarchical hub location problem with two layers is considered. The first layer includes small hubs and the second one includes a star-shaped network central hub. The considered case is a cargo delivery network where there is hierarchy between hubs. All the hubs and links are capacitated and there are three kinds of commodities for each of which there is a special kind of vehic...

Abstract. We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are located in a cycle, which is called a cycle-star hub network design problem. The problem is essentially equivalent to a cycle-metric labeling problem....