Integer and combinatorial optimization
Integer and combinatorial optimization
Lower bounds for the hub location problem
Management Science
An efficient procedure for designing single allocation hub and spoke systems
Management Science
HubLocator: an exact solution method for the multiple allocation hub location problem
Computers and Operations Research - Location analysis
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems
INFORMS Journal on Computing
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
Transportation Science
Simultaneous Assignment of Locomotives and Cars to Passenger Trains
Operations Research
Hub-and-spoke network design with congestion
Computers and Operations Research
Uncapacitated single and multiple allocation p-hub center problems
Computers and Operations Research
Benders Decomposition for Hub Location Problems with Economies of Scale
Transportation Science
Multiple allocation hub-and-spoke network design under hub congestion
Computers and Operations Research
The uncapacitated hub location problem in networks under decentralized management
Computers and Operations Research
Benders Decomposition for Large-Scale Uncapacitated Hub Location
Operations Research
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels
Transportation Science
Computers and Industrial Engineering
Hi-index | 0.01 |
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.