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

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

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

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

 We introduce a dynamic and stochastic transportation problem consisting of two subproblems. For parcel transportation in hub-and-spoke networks, swap containers are used to carry out hub-to-hub shipments. This constitutes a pickup and delivery problem on the operational level. On the tactical level, empty swap containers are balanced over the hub-network in order to match the stochastic deman...

The biggest challenges faced in big cities are greenhouse gas emission and growing energy needs. Efficient utilization of existing infrastructures has a prominent role in response to the challenges. Energy hub approach embraces performance of different energy networks. Energy hub is defined as a super node in electrical system receiving distinctive energy carriers such as gas and electricity in...

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

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