Single allocation hub location problem under congestion: Network owner and user perspectives
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. (C) 2011 Elsevier Ltd. All rights reserved.
generalized benders decomposition congestioned hub-and-spoke networks nonlinear mixed-integer programming