Hub-and-spoke network design with congestion

Authors:
Samir Elhedhli;Frank Xiaolong Hu
Affiliations:
Department of Management Sciences, University of Waterloo, Waterloo, Canada;Department of Management Sciences, University of Waterloo, Waterloo, Canada
Venue:
Computers and Operations Research
Year:
2005

Citing 6
Cited 6

Avoiding local optima in the p-hub location problem using tabu search and grasp

Annals of Operations Research - Special issue on locational decisions
Lower bounds for the hub location problem

Management Science
An efficient procedure for designing single allocation hub and spoke systems

Management Science
Location models for airline hubs behaving as M/D/c queues

Computers and Operations Research
Solving hub arc location problems on a cluster of workstations

Parallel Computing - Special issue: Parallel computing in logistics
The Latest Arrival Hub Location Problem

Management Science

Benders decomposition for the uncapacitated multiple allocation hub location problem

Computers and Operations Research
Benders Decomposition for Hub Location Problems with Economies of Scale

Transportation Science
Multiple allocation hub-and-spoke network design under hub congestion

Computers and Operations Research
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion

INFORMS Journal on Computing
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

INFORMS Journal on Computing
Single allocation hub location problem under congestion: Network owner and user perspectives

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a hub-and-spoke network design problem with congestion. The model we propose extends current models by taking congestion effects into account. This is achieved through a non-linear cost term in the objective function. We first linearize the model, and then provide a Lagrangean heuristic that finds high-quality solutions within reasonable computational time. The results of the model provide new and realistic insights into the hub-and-spoke network design problem.