research-article

The three-hub center allocation problem

Author:

Li ZhangAuthors Info & Claims

ACMSE '09: Proceedings of the 47th annual ACM Southeast Conference

Article No.: 44, Pages 1 - 5

https://doi.org/10.1145/1566445.1566505

Published: 19 March 2009 Publication History

Get Access

Abstract

In a hub network, the p-hub center single allocation problem is to allocate each non-hub node to one and only one hub from a given set of p hubs such that the maximum travel time (or distance) between any origin-destination pair is minimized. The problem is NP-Complete in general. We address the three-hub center single allocation problem in this paper and provide a polynomial algorithm to solve the p-hub center single allocation problem when p = 3.

References

[1]

A. M. Campbell, T. J. Lowe, and L. Zhang. The p-hub center allocation problem. European Journal of Operational Research, 176:819--835, 2007.

Crossref

Google Scholar

[2]

J. F. Campbell. Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72:387--405, 1994.

Crossref

Google Scholar

[3]

J. F. Campbell. Hub location and the p-hub median problem. Operations Research, 44:923--935, 1996.

Digital Library

Google Scholar

[4]

A. Ernst, H. Hamacher, H. Jiang, M. Krishnamoorthy, and G. Woeginger. Uncapacitated single and multiple allocation p-hub center problems. Technical report, CSIRO Mathematical and Information Science, Australia, 2002.

Google Scholar

[5]

A. Ernst and M. Krishnamoorthy. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4(3):139--154, 1996.

Crossref

Google Scholar

[6]

M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.

Digital Library

Google Scholar

[7]

A. V. Iyer and H. D. Ratliff. Accumulation point location on tree networks for guaranteed time distribution. Management Science, 36(8):958--969, 1990.

Digital Library

Google Scholar

[8]

B. Y. Kara and B. C. Tansel. On the single-assignment p-hub center problem. European Journal of Operational Research, 125(3):648--655, 2000.

Crossref

Google Scholar

[9]

J. G. Klincewicz. Heuristics for the p-hub location problem. European Journal of Operational Research, 53(1):25--37, 1991.

Crossref

Google Scholar

[10]

M. E. O'Kelly. The location of interacting hub facilities. Transportation Science, 20(2):92--106, 1986.

Digital Library

Google Scholar

[11]

M. E. O'Kelly. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32:393--404, 1987.

Crossref

Google Scholar

[12]

M. E. O'Kelly, D. Bryan, D. Skorin-Kapov, and J. Skorin-Kapov. Hub network design with single and multiple allocation: A computational study. Location Science, 4(3):125--138, 1997.

Crossref

Google Scholar

[13]

M. E. O'Kelly and H. J. Miller. Solution strategies for the single facility minimax hub location problem. Papers in Regional Science: The Journal of the RSAI, 70:367--380, 1991.

Crossref

Google Scholar

[14]

P. Pamuk and C. Sepil. A solution to the hub center problem via a single-relocation algorithm with tabu search. IEE Transactions, 33:399--411, 2001.

Crossref

Google Scholar

Cited By

View all

Mohri SAkbarzadeh M(2018)Incomplete Hub Location Model for Designing Van-Taxi NetworksTransportation Research Record: Journal of the Transportation Research Board10.1177/03611981187835972672:8(619-628)Online publication date: 30-Jun-2018
https://doi.org/10.1177/0361198118783597

Index Terms

The three-hub center allocation problem
1. Mathematics of computing
  1. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Uncapacitated single and multiple allocation p-hub center problems

The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost ...
Uncapacitated single allocation p-hub maximal covering problem

The hub location problem is to find a set of hub nodes on the network, where logistics transportation via the hubs is encouraged because of the cost or distance savings. Each node that has a specified amount of demands can be connected to one of p hubs. ...
A single allocation p-hub median problem with general piecewise-linear costs in arcs
Highlights
- We formulate and solve a single allocation p-hub median problem.
- The cost of ...
Abstract
Hubs are used in postal, air passenger transportation, and less-than-truckload (LTL) transportation industries to consolidate, sort, and classify the flows from multiple origins to multiple destinations (OD pairs). Hub-and-spoke ...

Comments

Information & Contributors

Information

Published In

ACMSE '09: Proceedings of the 47th annual ACM Southeast Conference

March 2009

430 pages

ISBN:9781605584218

DOI:10.1145/1566445

Conference Chair:
John D. McGregor

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ACM SE 09

ACM SE 09: ACM Southeast Regional Conference

March 19 - 21, 2009

South Carolina, Clemson

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
113
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mohri SAkbarzadeh M(2018)Incomplete Hub Location Model for Designing Van-Taxi NetworksTransportation Research Record: Journal of the Transportation Research Board10.1177/03611981187835972672:8(619-628)Online publication date: 30-Jun-2018
https://doi.org/10.1177/0361198118783597

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Uncapacitated single and multiple allocation p-hub center problems

Uncapacitated single allocation p-hub maximal covering problem

A single allocation p-hub median problem with general piecewise-linear costs in arcs

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations