The three-hub center allocation problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The three-hub center allocation problem

Full text

Pdf (765 KB)

Source

ACM Southeast Regional Conference archive
Proceedings of the 47th Annual Southeast Regional Conference table of contents

Clemson, South Carolina

SESSION: Algorithms table of contents

Article No. 44

Year of Publication: 2009

ISBN:978-1-60558-421-8

Author

Li Zhang

The Citadel, Charleston, SC

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 9, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1566445.1566505 What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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.
	2	J. F. Campbell. Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72:387--405, 1994.
	3	J. F. Campbell. Hub location and the p-hub median problem. Operations Research, 44:923--935, 1996.
	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.
	5	A. Ernst and M. Krishnamoorthy. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4(3):139--154, 1996.
	6	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	7	Ananth V. Iyer , H. Donald Ratliff, Accumulation point location on tree networks for guaranteed time distribution, Management Science, v.36 n.8, p.958-969, Aug. 1990 [doi>10.1287/mnsc.36.8.958]
	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.
	9	J. G. Klincewicz. Heuristics for the p-hub location problem. European Journal of Operational Research, 53(1):25--37, 1991.
	10	M. E. O'Kelly. The location of interacting hub facilities. Transportation Science, 20(2):92--106, 1986.
	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.
	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.
	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.
	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.