The air transportation hub-and-spoke design problem: comparison between a continuous and a discrete solution method

AUTOR(ES)

Alzamora, Guina Sotomayor, Raupp, Fernanda M.P., Pizzolato, Nelio D., Xavier, Adilson E.

FONTE

Pesqui. Oper.

DATA DE PUBLICAÇÃO

25/10/2013

RESUMO

The hub-and-spoke network design problem, also known as the hub location problem, aims to find the concentration points in a given network flow so that the sum of the distances of the linkages is minimized. In this work, we compare discrete solutions of this problem, given by the branch-and-cut method applied to the p-hub median model, with continuous solutions, given by the hyperbolic smoothing technique applied to a min-sum-min model. Computational experiments for particular instances of the Brazilian air transportation system, with the number of hubs varying from 2 to 8, are conducted with the support of a discretization heuristic and the Voronoi diagram.

Documentos Relacionados

• Addressing congestion on single allocation hub-and-spoke networks
• STOCHASTIC KNAPSACK PROBLEM: APPLICATION TO TRANSPORTATION PROBLEMS
• Solution of the discrete Plateau problem.
• MODELS AND METHODS FOR LOGISTICS HUB LOCATION: A REVIEW TOWARDS TRANSPORTATION NETWORKS DESIGN
• The Map Problem: A Comparison of Genetic and Sequence-Based Physical Maps