Addressing congestion on single allocation hub-and-spoke networks

AUTOR(ES)

Camargo, Ricardo Saraiva de, Miranda Jr, Gilberto de

FONTE

Pesqui. Oper.

DATA DE PUBLICAÇÃO

30/11/2012

RESUMO

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.

Documentos Relacionados

• The air transportation hub-and-spoke design problem: comparison between a continuous and a discrete solution method
• Hub location under hub congestion and demand uncertainty: the Brazilian case study
• Uma implementação em paralelo para decomposicção de benders aplicada a sistemas eixoraio com múltipla atribuição.
• MODELS AND METHODS FOR LOGISTICS HUB LOCATION: A REVIEW TOWARDS TRANSPORTATION NETWORKS DESIGN
• Alocação de custos de congestionamento em redes de transmissão de energia elétrica baseada no princípio usuário-pagador