Abstract
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. © 2013 Operational Research Society Ltd.
Author supplied keywords
Cite
CITATION STYLE
Lowe, T. J., & Sim, T. (2013). The hub covering flow problem. Journal of the Operational Research Society, 64(7), 973–981. https://doi.org/10.1057/jors.2012.122
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
