Location models for airline hubs behaving as M/D/c queues
Computers and Operations Research
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Hub-and-spoke network design with congestion
Computers and Operations Research
Capacitated single allocation hub location problem-A bi-criteria approach
Computers and Operations Research
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
INFORMS Journal on Computing
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
INFORMS Journal on Computing
Practical enhancements to the Magnanti-Wong method
Operations Research Letters
Computers and Industrial Engineering
Hi-index | 12.05 |
The single allocation hub location problem under congestion is addressed in this article. This mixed integer non-linear programming problem is referential in discrete location research having many real applications. Two different network design perspectives are proposed: the network owner and the network user. These perspectives can be translated into mathematical programming problems that are very hard to solve due to their inherently high combinatorial nature combined to the nonlinearities associated to congestion. A very efficient and effective generalized Benders decomposition algorithm is then deployed, enabling the solution of large scale instances in reasonable time.