In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport providers. This problem is variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to hub node form (cycles) starting from and ending node. motivated two real-life practices in logistics runaway connections with their associated economies sca...

We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuri...

In this paper, we propose an extension of the uncapacitated hub location problem where potential positions hubs are not fixed in advance. Instead, they allowed to belong a region around initial discrete set nodes. We give general framework which collection, transportation, and distribution costs based on norm-based distances hub-activation setup depend only that opened but also size placed. Two...

Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

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

In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given...