Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm (original) (raw)
Related papers
Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm
2015
In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo- hub allocations. We propose a mathematical model and a branch-and-cut algorithm based on Benders decomposition to solve the problem. To accelerate convergence, our solution framework embeds an efficient heuristic producing high-quality solutions in short computation times. In addition, we show how symmetry can be exploited to accelerate and improve the performance of our method.
Benders decomposition for the uncapacitated multiple allocation hub location problem
Computers & Operations Research, 2008
In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported on links established between hubs, being then splitted and delivered to its final destination. Systems with this sort of topology are named hub-and-spoke (HS) systems or hub-and-spoke networks. They are designed to exploit the scale economies attainable through the shared use of high capacity links between hubs. Therefore, the problem is to find the least expensive HS network, selecting hubs and assigning traffic to them, given the demands between each origin–destination pair and the respective transportation costs. In the present paper, we present efficient Benders decomposition algorithms based on a well known formulation to tackle the UMAHLP. We have been able to solve some large instances, considered ‘out of reach’ of other exact methods in reasonable time.
Hub location problems in transportation networks
Transportation Research Part E: Logistics and …, 2011
j o u r n a l h o m e p a g e : w w w . e l s e v i e r . c o m / l o c a t e / t r e underutilized links in favor of concentrating flow on hub edges and better utilization of facilities operating there. As a result of this flow concentration, economies of scale can be exploited by using more efficient transporters on the hub links.
A branch-and-cut algorithm for the partitioning-hub location-routing problem
Computers & Operations Research, 2011
We consider the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol called Intermediate System-Intermediate System (ISIS), and strategic planning of LTL ground freight distribution systems. We describe an Integer Programming (IP) formulation for solving PHLRP. We also explore some valid inequalities for the IP formulation, which we take from the graph partitioning literature. We test effectiveness of the IP formulation and the valid inequalities. Our experiments show that the valid inequalities perform better than the XPRESS proprietary cuts.
p-hub location routing problem, 2019
A variant of the hub location routing problem studied in this work, which is the problem of locating a set of hub nodes, is establishing the hub-level network and allocating the spoke nodes to the hub nodes. As a particular property of this problem , each cluster of spoke nodes allocated to a hub constitutes a directed route that starts from the hub, visits all the spokes in the same cluster, and terminates to the same hub. We propose a hybrid of hyper-heuristic and a relax-and-cut solution method, which includes cooperation among several low-level heuristics governed and controlled by a learning mechanism. This hybridization provides a mechanism in which the obtained dual information through the Lagrangian relaxation (bundle) method being utilized to guide the local searches for constructing/improving feasible solutions. Several classes of valid inequalities as well as efficient separation routings are also proposed for being used within the relax-and-cut approach. Our extensive computational experiments confirm the efficiency of this solution method in terms of quality as well as computational time.
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming, 2005
The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.
A capacitated hub location problem in freight logistics multimodal networks
Optimization Letters, 2016
In this paper we deal with a capacitated hub location problem arising in a freight logistics context; in particular, we have the need of locating logistics platforms for containers travelling via road and rail. The problem is modelled on a weighed multimodal network. We give a mixed integer linear programming model for the problem, having the goal of minimizing the location and shipping costs. The proposed formulation presents some novel features for modelling capacity bounds that are given both for the candidate hub nodes and the arcs incident to them; further, the containerised origin-destination (o − d) demand can be split among several platforms and different travelling modes. Note that here the network is not fully connected and only one hub for each o − d pair is used, serving both to consolidate consignments on less transport connections and as reloading point for a modal change. Results of an extensive computational experimentation performed with randomly generated instances of different size and capacity values are reported. In the test bed designed to validate the proposed model all the instances up to 135 nodes and 20 candidate hubs are optimally solved in few seconds by the commercial solver CPLEX 12.5.
The hub location and routing problem
European Journal of Operational Research, 1995
In this paper, we consider the hub location and routing problem in which the hub locations and the service types for the routes between demand points are determined together. Rather than aggregating the demand for the services, flows from an origin to different destination points are considered separately. For each origin-destination pair, one-hub-stop, two-hub-stop and, when permitted, direct services are considered. In the system considered, the hubs interact with each other and the level of interaction between them is determined by the two-hub-stop service routes. A mathematical formulation of the problem and an algorithm solving the hub location and the routing subproblems separately in an iterative manner are presented. Computational experience with four versions of the proposed algorithm differing in the method used for finding starting solutions is reported.
Sādhanā, 2019
For the last twenty five years, hub location problems have become an important research area in the Location Theory. The use of hub and spoke network structure in modern transportation and telecommunication systems has a great effect on this. In hub and spoke systems flows from sources are collected in the hubs, which are generally located centrally and serve as collection and distribution points, and distributed to the destinations again via hubs to use advantages of the economies of scale. In this study, real-life problem of a Turkish public institution is addressed. Different from the studies in the literature, we consider an intermodal transportation network where spoke-to-hub and hub-to-spoke transportation could be either land or air movement while hub-tohub transportation is only air movement. The proposed study differs in some respects from studies in the literature. Firstly, obligation to use of hubs for the flows between origin and destination pairs is relaxed. Secondly, due to the special nature of the problem being addressed not all the nodes are considered to be candidates as hubs, instead some specific nodes are taken into consideration. Lastly, hubs' capacities are made to be affected by the flow not only from hubs but also spokes. The results showed that the proposed model produced a lower total cost compared to the studies in the literature and the current applied method.
Graph based approach to the minimum hub problem in transportation network
Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015
In this paper we consider a hub location problem in a real multimodal public transportation network. This problem is also known as the park-and-ride problem. Hubs stations are special facilities that serve as switches in such a network. In practice the set of hubs has a strategic importance, because all of the traffic that passes through the network can be controlled by these elements. From the theoretical point of view, the minimal hub problem is NP hard. Two different approaches to this problem are presented. The first group of methods bases on the greedy algorithms. In the second group the evolutionary strategy is used. The computational results for these algorithms proved a significant efficiency, what can be clearly expressed in terms of an input data reduction and also in quality measure values for the obtained solutions of this problem.