Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem

  • Ke-rui Weng
  • Chao Yang
  • Yun-feng Ma
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4113)


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.


Genetic Algorithm Tabu Search Tabu List Binary Tournament Selection Airline Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Campbell, J.F.: Hub Location and The P-Hub Median Problem. Operations Research 44, 923–935 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    O’Kelly, M., Skorin-Kapov, D., Skorin-Kapov, J.: Lower Bounds for The Hub Location Problem. Management Science 41, 713–721 (1995)zbMATHCrossRefGoogle Scholar
  3. 3.
    Campbell, J.F.: Integer Programming Formulations of Discrete Hub Location Problem. European Journal of Operational Research 72, 387–405 (1994)zbMATHCrossRefGoogle Scholar
  4. 4.
    Kara, B.Y., Tansel, B.C.: The Latest Arrival Hub Location Problem. European Journal of Operational Research 47, 1408–1420 (2000)Google Scholar
  5. 5.
    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)zbMATHCrossRefGoogle Scholar
  6. 6.
    Jaramillo, J.H., Bhadury, J., Batta, R.: On The Use of Genetic Algorithms to Solve Location Problems. Computers & Operations Research 29, 761–779 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Beasley, J.E., Chu, P.C.: A Genetic Algorithm for The Set Covering Problem. European Journal of Operational Research 94, 204–392 (1996)Google Scholar
  8. 8.
    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)zbMATHCrossRefGoogle Scholar
  9. 9.
    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)zbMATHCrossRefGoogle Scholar
  10. 10.
    Marianov, V., Serra, D., Revelle, C.: Location of Hubs in A Competitive Environment. European Journal of Operational Research 114, 363–371 (1999)zbMATHCrossRefGoogle Scholar
  11. 11.
    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)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ke-rui Weng
    • 1
  • Chao Yang
    • 1
  • Yun-feng Ma
    • 1
  1. 1.School of ManagementHuazhong University of Science and TechnologyWuhanP.R. China

Personalised recommendations