Table of Contents Author Guidelines Submit a Manuscript
Journal of Advanced Transportation
Volume 2017, Article ID 9387302, 23 pages
https://doi.org/10.1155/2017/9387302
Review Article

Finding -Hub Median Locations: An Empirical Study on Problems and Solution Techniques

1School of Electronic and Information Engineering, Beihang University, Beijing 100191, China
2Beijing Key Laboratory for Network-Based Cooperative ATM, Beijing 100191, China
3Department of Civil and Environmental Engineering, University of South Florida, Tampa, FL 33620, USA
4College of Air Traffic Management, Civil Aviation University of China, Tianjin 300300, China
5College of Transportation Engineering, Tongji University, Shanghai 200092, China

Correspondence should be addressed to Sebastian Wandelt; ed.nilreb-uh.kitamrofni@tlednaw

Received 18 May 2017; Revised 22 October 2017; Accepted 31 October 2017; Published 23 November 2017

Academic Editor: Zhi-Chun Li

Copyright © 2017 Xiaoqian Sun et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. E. O'elly, “The location of interacting hub facilities,” Transportation science, vol. 20, no. 2, pp. 92–106, 1986. View at Google Scholar
  2. S. Gelareh and S. Nickel, “Hub location problems in transportation networks,” Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 6, pp. 1092–1111, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. An, B. Zeng, Y. Zhang, and L. Zhao, “Reliable p-median facility location problem: Two-stage robust models and algorithms,” Transportation Research Part B: Methodological, vol. 64, pp. 54–72, 2014. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Gelareh, R. Neamatian Monemi, and S. Nickel, “Multi-period hub location problems in transportation,” Transportation Research Part E: Logistics and Transportation Review, vol. 75, pp. 67–94, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Wang, X. Qu, T. Wang, and W. Yi, “Optimal Container Routing in Liner Shipping Networks Considering Repacking 20 ft Containers into 40 ft Containers,” Journal of Advanced Transportation, vol. 2017, 9 pages, 2017. View at Publisher · View at Google Scholar
  6. Y. Park and M. E. O'Kelly, “Origin-destination synthesis for aviation network data: examining hub operations in the domestic and international US markets,” Journal of Advanced Transportation, vol. 50, no. 8, pp. 2288–2305, 2016. View at Publisher · View at Google Scholar
  7. H. Yaman and G. Carello, “Solving the hub location problem with modular link capacities,” Computers & Operations Research, vol. 32, no. 12, pp. 3227–3245, 2005. View at Publisher · View at Google Scholar
  8. H. Kim and M. E. O'Kelly, “Reliable p-hub location problems in telecommunication networks,” Geographical Analysis, vol. 41, no. 3, pp. 283–306, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Alumur and B. Y. Kara, “Network hub location problems: the state of the art,” European Journal of Operational Research, vol. 190, no. 1, pp. 1–21, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J. F. Campbell and M. E. O'Kelly, “Twenty-five years of hub location research,” Transportation Science, vol. 46, no. 2, pp. 153–169, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Z. Farahani, M. Hekmatfar, A. B. Arabani, and E. Nikbakhsh, “Hub location problems: a review of models, classification, solution techniques, and applications,” Computers & Industrial Engineering, vol. 64, no. 4, pp. 1096–1109, 2013. View at Publisher · View at Google Scholar · View at Scopus
  12. M. E. O'Kelly, “A quadratic integer program for the location of interacting hub facilities,” European Journal of Operational Research, vol. 32, no. 3, pp. 393–404, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J. F. Campbell, “Hub location and the p-hub median problem,” Operations Research, vol. 44, no. 6, pp. 923–935, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  14. S. Wandelt, X. Sun, and X. Cao, “Computationally efficient attack design for robustness analysis of air transportation networks,” Transportmetrica A: Transport Science, vol. 11, no. 10, pp. 939–966, 2015. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Wandelt, X. Sun, M. Zanin, and S. Havlin, “QRE: quick robustness estimation for large complex networks,” Future Generation Computer Systems, 2017. View at Publisher · View at Google Scholar
  16. X. Sun, V. Gollnick, and S. Wandelt, “Robustness analysis metrics for worldwide airport network: a comprehensive study,” Chinese Journal of Aeronautics, vol. 30, no. 2, pp. 500–512, 2017. View at Publisher · View at Google Scholar
  17. X. Sun, S. Wandelt, and F. Linke, “On the topology of air navigation route systems,” Proceedings of the ICE - Transport, vol. 170, no. 1, pp. 46–59, 2017. View at Publisher · View at Google Scholar
  18. S. A. Alumur, B. Y. Kara, and O. E. Karasan, “The design of single allocation incomplete hub networks,” Transportation Research Part B: Methodological, vol. 43, no. 10, pp. 936–951, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. T. Meyer, A. T. Ernst, and M. Krishnamoorthy, “A 2-phase algorithm for solving the single allocation p-hub center problem,” Computers & Operations Research, vol. 36, no. 12, pp. 3143–3151, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Ortiz-Astorquiza, I. Contreras, and G. Laporte, “Multi-level facility location as the maximization of a submodular set function,” European Journal of Operational Research, vol. 247, no. 3, Article ID 13006, pp. 1013–1016, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. D. Skorin-Kapov and J. Skorin-Kapov, “On tabu search for the location of interacting hub facilities,” European Journal of Operational Research, vol. 73, no. 3, pp. 502–509, 1994. View at Publisher · View at Google Scholar · View at Scopus
  22. A. T. Ernst and M. Krishnamoorthy, “Efficient algorithms for the uncapacitated single allocationp-hub median problem,” Location Science, vol. 4, no. 3, pp. 139–154, 1996. View at Publisher · View at Google Scholar · View at Scopus
  23. H. Pirkul and D. A. Schilling, “An efficient procedure for designing single allocation hub and spoke systems,” Management Science, vol. 44, no. 12, pp. S235–S242, 1998. View at Publisher · View at Google Scholar · View at Scopus
  24. I. Contreras, J. A. Daz, and E. Fernández, “Branch and price for large-scale capacitated hub location problems with single assignment,” INFORMS Journal on Computing, vol. 23, no. 1, pp. 41–55, 2011. View at Google Scholar
  25. S. Elhedhli and H. Wu, “A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion,” INFORMS Journal on Computing, vol. 22, no. 2, pp. 282–296, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y. An, Y. Zhang, and B. Zeng, “The reliable hub-and-spoke design problem: Models and algorithms,” Transportation Research Part B: Methodological, vol. 77, pp. 103–122, 2015. View at Publisher · View at Google Scholar · View at Scopus
  27. H. Topcuoglu, F. Corut, M. Ermis, and G. Yilmaz, “Solving the uncapacitated hub location problem using genetic algorithms,” Computers & Operations Research, vol. 32, no. 4, pp. 967–984, 2005. View at Publisher · View at Google Scholar · View at Scopus
  28. J. Kratica, Z. Stanimirović, D. s. Tošić, and V. Filipović, “Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem,” European Journal of Operational Research, vol. 182, no. 1, pp. 15–28, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  29. I. Contreras, J.-F. Cordeau, and G. Laporte, “Benders decomposition for large-scale uncapacitated hub location,” Operations Research, vol. 59, no. 6, pp. 1477–1490, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. Z. Stanimirović, “A genetic algorithm approach for the capacitated single allocation p-hub median problem,” Computing and Informatics, vol. 29, no. 1, pp. 117–132, 2012. View at Google Scholar · View at Scopus
  31. H. Damgacioglu, D. Dinler, N. E. Evin Ozdemirel, and C. Iyigun, “A genetic algorithm for the uncapacitated single allocation planar hub location problem,” Computers & Operations Research, vol. 62, pp. 224–236, 2015. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Peker, B. Y. Kara, J. F. Campbell, and S. A. Alumur, “Spatial analysis of single allocation hub location problems,” Networks and Spatial Economics, vol. 16, no. 4, pp. 1075–1101, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. N. Azizi, S. Chauhan, S. Salhi, and N. Vidyarthi, “The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques,” Computers & Operations Research, vol. 65, pp. 174–188, 2016. View at Publisher · View at Google Scholar · View at Scopus
  34. R. S. de Camargo, G. de Miranda, M. E. O’Kelly, and J. F. Campbell, “Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints,” Applied Mathematical Modelling, vol. 51, C, pp. 274–301, 2017. View at Publisher · View at Google Scholar
  35. M. P. Pérez, F. A. Rodrguez, and J. M. M. Vega, “On the use of path relinking for the ρ–hub median problem,” in European Conference on Evolutionary Computation in Combinatorial Optimization, pp. 155–164, Springer, 2004.
  36. M. Bashiri, M. Mirzaei, and M. Randall, “Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution,” Applied Mathematical Modelling, vol. 37, no. 5, pp. 3513–3525, 2013. View at Publisher · View at Google Scholar · View at Scopus
  37. J. Zheng, Q. Meng, and Z. Sun, “Liner hub-and-spoke shipping network design,” Transportation Research Part E: Logistics and Transportation Review, vol. 75, pp. 32–48, 2015. View at Publisher · View at Google Scholar · View at Scopus
  38. E. Weiszfeld, “Sur le point pour lequel la somme des distances de n points donnés est minimum,” Tohoku Mathematical Journal, vol. 43, no. 2, pp. 355–386, 1937. View at Google Scholar
  39. T. Aykin and G. F. Brown, “Interacting new facilities and location-allocation problems,” Transportation Science, vol. 26, no. 3, pp. 212–222, 1992. View at Publisher · View at Google Scholar · View at Scopus
  40. T. Cui, Y. Ouyang, and Z. M. Shen, “Reliable facility location design under the risk of disruptions,” Operations Research, vol. 58, no. 4, part 1, pp. 998–1011, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. M. Iwasa, H. Saito, and T. Matsui, “Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems,” Discrete Applied Mathematics, vol. 157, no. 9, pp. 2078–2088, 2009. View at Publisher · View at Google Scholar · View at Scopus
  42. I. Correia, S. Nickel, and F. Saldanha-da-Gama, “Single-assignment hub location problems with multiple capacity levels,” Transportation Research Part B: Methodological, vol. 44, no. 8-9, pp. 1047–1066, 2010. View at Publisher · View at Google Scholar · View at Scopus
  43. R. S. de Camargo, G. d. Miranda, and H. Luna, “Benders decomposition for the uncapacitated multiple allocation hub location problem,” Computers Operations Research, vol. 35, no. 4, pp. 1047–1064, 2008. View at Google Scholar
  44. L. Cánovas, S. Garca, and A. Marn, “Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique,” European Journal of Operational Research, vol. 179, no. 3, pp. 990–1007, 2007. View at Google Scholar
  45. A. Marín, L. Cánovas, and M. Landete, “New formulations for the uncapacitated multiple allocation hub location problem,” European Journal of Operational Research, vol. 172, no. 1, pp. 274–292, 2006. View at Publisher · View at Google Scholar · View at Scopus
  46. J. Puerto, A. B. Ramos, A. M. Rodríguez-Chía, and M. C. Sánchez-Gil, “Ordered median hub location problems with capacity constraints,” Transportation Research Part C: Emerging Technologies, vol. 70, pp. 142–156, 2016. View at Publisher · View at Google Scholar · View at Scopus
  47. Q. Meng and X. Wang, “Intermodal hub-and-spoke network design: incorporating multiple stakeholders and multi-type containers,” Transportation Research Part B: Methodological, vol. 45, no. 4, pp. 724–742, 2011. View at Publisher · View at Google Scholar · View at Scopus
  48. S. A. Alumur, S. Nickel, and F. Saldanha-da-Gama, “Hub location under uncertainty,” Transportation Research Part B: Methodological, vol. 46, no. 4, pp. 529–543, 2012. View at Publisher · View at Google Scholar · View at Scopus
  49. S. A. Alumur, H. Yaman, and B. Y. Kara, “Hierarchical multimodal hub location problem with time-definite deliveries,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 6, pp. 1107–1120, 2012. View at Publisher · View at Google Scholar · View at Scopus
  50. A. I. Mahmutogullari and B. Y. Kara, “Hub location under competition,” European Journal of Operational Research, vol. 250, no. 1, pp. 214–225, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  51. S. Çetiner, An iterative hub location and routing problem for postal delivery systems [Ph.D. thesis], Citeseer, 2003.
  52. J.-F. Chen, “A hybrid heuristic for the uncapacitated single allocation hub location problem,” Omega , vol. 35, no. 2, pp. 211–220, 2006. View at Publisher · View at Google Scholar · View at Scopus
  53. S. Belkoura, J. M. Peña, and M. Zanin, “Beyond linear delay multipliers in air transport,” Journal of Advanced Transportation, vol. 2017, 11 pages, 2017. View at Publisher · View at Google Scholar
  54. L. V. Snyder and M. S. Daskin, “Reliability models for facility location: the expected failure cost case,” Transportation Science, vol. 39, no. 3, pp. 400–416, 2005. View at Publisher · View at Google Scholar · View at Scopus
  55. J. F. Meier and U. Clausen, “Solving classical and new single allocation hub location problems on euclidean data,” Tech. Rep., Optimization Online, 2015, 2015, http://www.optimization-online.org/DB_HTML/2015/03/4816.html. View at Google Scholar
  56. I. Contreras, J.-F. Cordeau, and G. Laporte, “Stochastic uncapacitated hub location,” European Journal of Operational Research, vol. 212, no. 3, pp. 518–528, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  57. D. Zhang, F. Zou, S. Li, and L. Zhou, “Green Supply Chain Network Design with Economies of Scale and Environmental Concerns,” Journal of Advanced Transportation, vol. 2017, 14 pages, 2017. View at Publisher · View at Google Scholar
  58. J. G. Klincewicz, “A dual algorithm for the uncapacitated hub location problem,” Location Science, vol. 4, no. 3, pp. 173–184, 1996. View at Publisher · View at Google Scholar · View at Scopus
  59. J. F. Campbell, “Integer programming formulations of discrete hub location problems,” European Journal of Operational Research, vol. 72, no. 2, pp. 387–405, 1994. View at Publisher · View at Google Scholar · View at Scopus
  60. J. Ebery, M. Krishnamoorthy, A. Ernst, and N. Boland, “Capacitated multiple allocation hub location problem: Formulations and algorithms,” European Journal of Operational Research, vol. 120, no. 3, pp. 614–631, 2000. View at Publisher · View at Google Scholar · View at Scopus
  61. W. Chaovalitwongse, P. M. Pardalos, and O. A. Prokopyev, “A new linearization technique for multi-quadratic 0-1 programming problems,” Operations Research Letters, vol. 32, no. 6, pp. 517–522, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  62. C. B. Cunha and M. R. Silva, “A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil,” European Journal of Operational Research, vol. 179, no. 3, pp. 747–758, 2007. View at Publisher · View at Google Scholar · View at Scopus
  63. R. C. Prim, “Shortest connection networks and some generalizations,” Bell Labs Technical Journal, vol. 36, no. 6, pp. 1389–1401, 1957. View at Publisher · View at Google Scholar
  64. M. L. Fisher, “The lagrangian relaxation method for solving integer programming problems,” Management Science, vol. 50, no. 12, pp. 1861–1874, 2004. View at Publisher · View at Google Scholar · View at Scopus
  65. M. Drexl and M. Schneider, “A survey of variants and extensions of the location-routing problem,” European Journal of Operational Research, vol. 241, no. 2, pp. 283–308, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  66. H. Yaman, “Allocation strategies in hub networks,” European Journal of Operational Research, vol. 211, no. 3, pp. 442–451, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  67. C. Li, H. Yang, D. Zhu, and Q. Meng, “A global optimization method for continuous network design problems,” Transportation Research Part B: Methodological, vol. 46, no. 9, pp. 1144–1158, 2012. View at Publisher · View at Google Scholar · View at Scopus
  68. S. Wang, Q. Meng, and H. Yang, “Global optimization methods for the discrete network design problem,” Transportation Research Part B: Methodological, vol. 50, pp. 42–60, 2013. View at Publisher · View at Google Scholar · View at Scopus
  69. X. Sun, S. Wandelt, M. Hansen, and A. Li, “Multiple airport regions based on inter-airport temporal distances,” Transportation Research Part E: Logistics and Transportation Review, vol. 101, pp. 84–98, 2017. View at Publisher · View at Google Scholar
  70. X. Sun, Y. Zhang, and S. Wandelt, “Air transport versus high-speed rail: an overview and research agenda,” Journal of Advanced Transportation, vol. 2017, Article ID 8426926, 18 pages, 2017. View at Publisher · View at Google Scholar