Abstract
We consider the multiple allocation hub maximal covering problem (MAHMCP): considering a serviced O–D flow was required to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate p hubs to maximize the serviced flows. By designing a new model for the MAHMCP, we provide two artificial intelligence heuristics based on tabu search and genetic algorithm respectively. Then, we present computational experiments on hub airports location of Chinese aerial freight flows between 82 cities in 2002 and AP data set. By the computational experiments, we find that both GA and TS work well for MAHMCP. We also conclude that genetic algorithm readily finds a better computational result for the MAHMCP, while the tabu search may have a better computational efficiency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Campbell, J.F.: Hub Location and The P-Hub Median Problem. Operations Research 44, 923–935 (1996)
O’Kelly, M., Skorin-Kapov, D., Skorin-Kapov, J.: Lower Bounds for The Hub Location Problem. Management Science 41, 713–721 (1995)
Campbell, J.F.: Integer Programming Formulations of Discrete Hub Location Problem. European Journal of Operational Research 72, 387–405 (1994)
Kara, B.Y., Tansel, B.C.: The Latest Arrival Hub Location Problem. European Journal of Operational Research 47, 1408–1420 (2000)
Kara, B.Y., Tansel, B.C.: The Single-Assignment Hub Covering Problem: Models and linearzations. Journal of the Operational Research Society 54, 59–64 (2003)
Jaramillo, J.H., Bhadury, J., Batta, R.: On The Use of Genetic Algorithms to Solve Location Problems. Computers & Operations Research 29, 761–779 (2002)
Beasley, J.E., Chu, P.C.: A Genetic Algorithm for The Set Covering Problem. European Journal of Operational Research 94, 204–392 (1996)
Topcuoglu, H., Corut, F., Ermis, M., et al.: Solving The Uncapacitated Hub Location Problem Using Genetic Algorithms. Computers and Operations Research 32, 967–984 (2005)
Skorin-Kapov, D., Skorin-Kapov, J.: On Tabu Search for The Location of Interacting Hub Facilities. European Journal of Operational Research 73, 502–509 (1994)
Marianov, V., Serra, D., Revelle, C.: Location of Hubs in A Competitive Environment. European Journal of Operational Research 114, 363–371 (1999)
Klincewicz, J.G.: Avoiding Local Optima in The P-Hub Location Problem Using Tabu Search and GRASP. Annals of Operations Research 40, 283–302 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weng, Kr., Yang, C., Ma, Yf. (2006). Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_90
Download citation
DOI: https://doi.org/10.1007/11816157_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37271-4
Online ISBN: 978-3-540-37273-8
eBook Packages: Computer ScienceComputer Science (R0)