Hub location problems in transportation networks

Shahin Gelareh*, Stefan Nickel

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node. While the existing state-of-the-art MIP solvers fail to solve even small size instances of problem, our accelerated and efficient primal (Benders) decomposition solves larger ones. In addition, a very efficient greedy heuristic, proven to be capable of obtaining high quality solutions, is proposed. We also introduce fixed cost values for Australian Post (AP) dataset.

Original languageEnglish
Pages (from-to)1092-1111
Number of pages20
JournalTransportation Research Part E: Logistics and Transportation Review
Issue number6
Publication statusPublished - Nov 2011
Externally publishedYes


  • Decomposition
  • Hub location
  • Integer programming
  • Lagrangian relaxation
  • Liner shipping
  • Local search
  • Urban transportation


Dive into the research topics of 'Hub location problems in transportation networks'. Together they form a unique fingerprint.

Cite this