| Article ID: | iaor2006677 |
| Country: | United Kingdom |
| Volume: | 32 |
| Issue: | 6 |
| Start Page Number: | 1615 |
| End Page Number: | 1632 |
| Publication Date: | Jun 2005 |
| Journal: | Computers and Operations Research |
| Authors: | Elhedhli Samir, Hu Frank Xiaolong |
| Keywords: | heuristics, networks, programming: nonlinear |
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.