View in EDS

The hub covering flow problem.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 88041677
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The hub covering flow problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lowe%2C+T+J%22">Lowe, T J</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Sim%2C+T%22">Sim, T</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+the+Operational+Research+Society%22">Journal of the Operational Research Society</searchLink>. Jul2013, Vol. 64 Issue 7, p973-981. 9p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Demand+flow+technology%22">Demand flow technology</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+calculations%22">Numerical calculations</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Network+hubs%22">Network hubs</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=88041677
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1057/jors.2012.122
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 973
    Subjects:
      – SubjectFull: Mathematical analysis
        Type: general
      – SubjectFull: Demand flow technology
        Type: general
      – SubjectFull: Numerical calculations
        Type: general
      – SubjectFull: Computer networks
        Type: general
      – SubjectFull: Network hubs
        Type: general
    Titles:
      – TitleFull: The hub covering flow problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lowe, T J
      – PersonEntity:
          Name:
            NameFull: Sim, T
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2013
              Type: published
              Y: 2013
          Identifiers:
            – Type: issn-print
              Value: 01605682
          Numbering:
            – Type: volume
              Value: 64
            – Type: issue
              Value: 7
          Titles:
            – TitleFull: Journal of the Operational Research Society
              Type: main
ResultId 1