Hub location problems in transportation networks

Publication: Research - peer-reviewJournal article – Annual report year: 2011

View graph of relations

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
JournalTransportation Research. Part E: Logistics and Transportation Review
Publication date2011
Volume47
Issue6
Pages1092-1111
ISSN1366-5545
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 11

Keywords

  • Liner shipping, Hub location, Urban transportation, Local search, Lagrangian relaxation, Decomposition, Integer programming
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5850749