| Article ID: | iaor20133684 |
| Volume: | 64 |
| Issue: | 7 |
| Start Page Number: | 973 |
| End Page Number: | 981 |
| Publication Date: | Jul 2013 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Lowe T J, Sim T |
| Keywords: | transportation: air |
The hub covering flow problem (HCFP) seeks to find the minimal cost hub‐and‐spoke network by optimally locating hub nodes and assigning non‐hub nodes to the hub nodes subject to a coverage constraint. The cost of establishing such a hub network is based on a fixed cost of opening hubs and the cost of transporting demand flow through the network. We also present an extension called the multi‐aircraft HCFP. The results from computational experiments are presented and discussed.