Bibliographic Details
| Title: |
The hub covering flow problem. |
| Authors: |
Lowe, T J1, Sim, T2 |
| Source: |
Journal of the Operational Research Society. Jul2013, Vol. 64 Issue 7, p973-981. 9p. |
| Subjects: |
Mathematical analysis, Demand flow technology, Numerical calculations, Computer networks, Network hubs |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
