Hub location problems in transportation networks

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

Standard

Hub location problems in transportation networks. / Gelareh, Shahin; Nickel, Stefan.

In: Transportation Research. Part E: Logistics and Transportation Review, Vol. 47, No. 6, 2011, p. 1092-1111.

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

Harvard

APA

CBE

MLA

Vancouver

Author

Gelareh, Shahin; Nickel, Stefan / Hub location problems in transportation networks.

In: Transportation Research. Part E: Logistics and Transportation Review, Vol. 47, No. 6, 2011, p. 1092-1111.

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

Bibtex

@article{84f36ad584c846a0819ae006876191d0,
title = "Hub location problems in transportation networks",
keywords = "Liner shipping, Hub location, Urban transportation, Local search, Lagrangian relaxation, Decomposition, Integer programming",
publisher = "Pergamon",
author = "Shahin Gelareh and Stefan Nickel",
year = "2011",
doi = "10.1016/j.tre.2011.04.009",
volume = "47",
number = "6",
pages = "1092--1111",
journal = "Transportation Research. Part E: Logistics and Transportation Review",
issn = "1366-5545",

}

RIS

TY - JOUR

T1 - Hub location problems in transportation networks

A1 - Gelareh,Shahin

A1 - Nickel,Stefan

AU - Gelareh,Shahin

AU - Nickel,Stefan

PB - Pergamon

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Liner shipping

KW - Hub location

KW - Urban transportation

KW - Local search

KW - Lagrangian relaxation

KW - Decomposition

KW - Integer programming

U2 - 10.1016/j.tre.2011.04.009

DO - 10.1016/j.tre.2011.04.009

JO - Transportation Research. Part E: Logistics and Transportation Review

JF - Transportation Research. Part E: Logistics and Transportation Review

SN - 1366-5545

IS - 6

VL - 47

SP - 1092

EP - 1111

ER -