Journal article
The hub covering flow problem
The Journal of the Operational Research Society, Vol.64(7), pp.973-981
07/01/2013
DOI: 10.1057/jors.2012.122
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.
Details
- Title: Subtitle
- The hub covering flow problem
- Creators
- T. J. Lowe - University of IowaT. Sim - Le Moyne College
- Resource Type
- Journal article
- Publication Details
- The Journal of the Operational Research Society, Vol.64(7), pp.973-981
- DOI
- 10.1057/jors.2012.122
- ISSN
- 0160-5682
- eISSN
- 1476-9360
- Number of pages
- 9
- Language
- English
- Date published
- 07/01/2013
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963115802771
Metrics
1 Record Views