Dynamic Virtual Hub Location Problem

Abstract:

A controversial issue in the planning of air transportation networks is inclement weather. In this situation, hub facilities would not be able to provide a good service to their spoke nodes temporarily. Thus, some other kinds of predetermined underutilized facilities in the network are used as virtual hubs to host some or all connections of original hubs to recover the incurred incapacitation and increase network flexibility and demand flow.Here, we present a dynamic virtual hub location problem with the aim of minimizing transportation cost in the network. We examine the effectiveness of our model using the US well-known CAB data set.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 4931-4935
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.4931
• Online since: January 2012
• Authors: Nima Tahami Baher, Farzin Taghipourian, Ehsan Teymourian
• Keywords: Location-Allocation, Mathematical Models, Virtual Hub

References

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

DOI: 10.1016/s0377-2217(87)80007-3

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

DOI: 10.1016/0377-2217(94)90318-2

[3] M.R., Silva, C.B. Cunha. New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Computers & Operations Research, 2009, 36: 3152–3165.

DOI: 10.1016/j.cor.2008.12.019

[4] A., Ilic, D., Urosevic, J., Brimberg, N., Mladenovic. A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research, 2010, 206: 289–300.

DOI: 10.1016/j.ejor.2010.02.022

[5] M.G., Costa, M.E., Captivo, J., Climaco. Capacitated single allocation hub location problem: a bi-criteria approach. Computers and Operations Research, 2008, 35: 3671–3695.

DOI: 10.1016/j.cor.2007.04.005

[6] I., Correia, S., Nickel, F., Saldanha-da-Gama. Single-assignment hub location problems with multiple capacity levels. Transportation Research Part B, 2010, 44: 1047–1066.

DOI: 10.1016/j.trb.2009.12.016

[7] I., Contreras, J.A., Diaz, E., Fernandez, E. Lagrangean relaxation for the capacitated hub location problem with single assignment. Operations Research Spectrum, 2009, 31: 483–505.

DOI: 10.1007/s00291-008-0159-y

[8] I., Contreras, J.A., Diaz, E., Fernandez. Branch and price for large-scale capacitated hub location problems with single assignment. Journal of Computing, 2010a, DOI: 10. 1287/ijoc. 1100. 0391.

DOI: 10.1287/ijoc.1100.0391

[9] T., Yang. Stochastic air freight hub location and flight routes planning. Applied Mathematical Modeling, 2009, 33: 4424–4430.

DOI: 10.1016/j.apm.2009.03.018

[10] I., Contreras, J., Cordeau, G., Laporte. The dynamic uncapacitated hub location problem. Transportation Science, 2010b, DOI: 10. 1287/trsc. 1100. 0326.

DOI: 10.1287/trsc.1100.0326