Academic Journals Database
Disseminating quality controlled scientific knowledge

Addressing congestion on single allocation hub-and-spoke networks

ADD TO MY LIST
 
Author(s): Ricardo Saraiva de Camargo | Gilberto de Miranda Jr

Journal: Pesquisa Operacional
ISSN 0101-7438

Volume: 32;
Issue: 3;
Start page: 465;
Date: 2012;
Original page

Keywords: single allocation hub location problem | Benders decomposition method | outer-approximation algorithm | large scale optimization

ABSTRACT
When considering hub-and-spoke networks with single allocation, the absence of alternative routes makes this kind of systems specially vulnerable to congestion effects. In order to improve the design of such networks, congestion costs must be addressed. This article deploys two different techniques for addressing congestion on single allocation hub-and-spoke networks: the Generalized Benders Decomposition and the Outer Approximation method. Both methods are able to solve large scale instances. Computational experiments show how the adoption of advanced solution strategies, such as Pareto-optimal cut generation on the Master Problem branch-and-bound tree, may be decisive. They also demonstrate that the solution effort is not only associated with the size of the instances, but also with their combination of the installation and congestion costs.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions