Quadratic Assignment of Hubs in p-Hub Median Problem

Publication: ResearchReport – Annual report year: 2010

NullPointerException

View graph of relations

We introduce Generalized p-Hub Median Problem (GpHMP) that seeks to locate p hub nodes and install p distinct hub facilities/operators on the hubs while discount factor resulted by consolidation of flow on the hub links depends on the facilities/operators that are installed/operating on both hub nodes end-point. In contrast, in traditional hub location problems it is commonly assumed that all the hub facilities share a similar characteristic and economy of scale resulted by consolidation of flow over hub edges is not directly relevant to the hub facilities being installed at both end-points. The mathematical model is presented and numerical results on the instances of CAB and AP data sets are reported.
Original languageEnglish
Publication date2010
Place of publicationKgs. Lyngby
PublisherDTU Management
Number of pages9
ISBN (print)978-87-90855-81-9
StatePublished
NameDTU Management 2010
Number12

Keywords

  • facility location, hub-and-spoke network design, quadratic assignment problem
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 4529732