The hub covering flow problem

T J Lowe and T Sim
Additional contact information
T J Lowe: University of Iowa, Iowa City, IA, USA
T Sim: Le Moyne College, Syracuse, NY, USA

Journal of the Operational Research Society, 2013, vol. 64, issue 7, 973-981

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.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v64/n7/pdf/jors2012122a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v64/n7/full/jors2012122a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:64:y:2013:i:7:p:973-981

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().