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

This paper proposes Dynamic Multiple Depots Vehicle Routing (DMDVR) to explore the feasible solution of routing transportation between PI-hubs and retailers in same cluster. The this research is constructed by daily forecasting demand a commodity crop, Pineapple, from Thailand’s northern region. Each route composed starting hub, number retailers, an ending hub. authors propose Mixed Integer Lin...

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

Hub location problems are strategic network planning problems. They formalise the challenge of mutually exchanging shipments between a large set of depots. The aim is to choose a set of hubs (out of a given set of possible hubs) and connect every depot to a hub so that the total transport costs for exchanging shipments between the depots are minimised. In classical hub location problems, the un...

Abstract Many of air cargo companies adapt the hub-and-spokes system where economies of scale exist in the transportation cost. In this paper, we formulate economies of scale using nonlinear cost function of distances and demands, and analyze how the change of the transportation cost affects single hub location of air cargo using the generalized Weber problem on the regular demand points of one...

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

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 Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in [36] that provides a unifying analysis of a wide class of hub location models. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also st...