This paper proposes a selection model of candidate nodes and an air parcel network hub location model to estimate the efficiency of the parcel network when adding pure freighters. Using the data on real demands among airports in practice, this article analyzes the hub location problem of the parcel network for DHL Express in the Asia-Pacific region. We find that Beijing, Hong Kong, Singapore, and Mascot are potential choices to be hub airports. The four hubs have parcel production of 10.1, 5.36, 2.75 and 0.84 million tons in the planning horizon, respectively. A sensitivity analysis is conducted to analyze the influence of different numbers of pure freighters on the air parcel network and the results indicate that the number of pure freighters can alleviate parcel pressure.
GoldmanA.Optimal locations for centers in a network. Transport Sci1969; 3(4): 352–360.
2.
O’KellyME.A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res1987; 32(3): 393–404.
3.
HallRW.Configuration of an overnight package air network. Transport Res A Gen1989; 23(2): 139–149.
4.
ÇetinerSSepilCSüralH.Hubbing and routing in postal delivery systems. Ann Oper Res2010; 181(1): 109–124.
5.
PengZShanWGuanFet al. Stable vessel–cargo matching in dry bulk shipping market with price game mechanism. Transport Res E-LOG. 2016; 95: 76–94.
6.
O’KellyMELaoY.Mode choice in a hub-and-spoke network: a zero-one linear programming approach. Geog Anal1991; 23(4): 283–297.
7.
ErnstATKrishnamoorthyM. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci1996; 4(3): 139–154.
8.
KlincewiczJG.Hub location in backbone/tributary network design: a review. Location Sci1998; 6(1): 307–335.
9.
CarelloGDella CroceFGhirardiMet al. Solving the hub location problem in telecommunication network design: a local search approach. Networks2004; 44(2): 94–105.
10.
YamanH.Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities. SIAM J Discrete Math2005; 19(2): 501–522.
11.
YamanHCarelloG.Solving the hub location problem with modular link capacities. Comput Oper Res2005; 32(12): 3227–3245.
12.
ZhangLWangYSunJet al. The sightseeing bus schedule optimization under park and ride system in tourist attractions. Ann Oper Res. 2016:1–19. DOI: 10.1007/s10479-016-2364-4.
EberyJ.Solving large single allocation p-hub problems with two or three hubs. Eur J Oper Res2001; 128(2): 447–458.
15.
KaraBYTanerMR. Hub location problems: the location of interacting facilities. In EiseltHMarianovV (eds.) Foundations of location analysis. New York: Springer, 2011, pp.273–288.
16.
PuertoJRamosARodríguez-ChíaAM.A specialized branch & bound & cut for single-allocation ordered median hub location problems. Discrete Appl Math. 2013; 161(16): 2624–2646.
17.
YuBZhuHCaiWet al. Two-phase optimization approach to transit hub location: the case of Dalian. J Transport Geog2013; 33: 62–71.
18.
YaoBYuBHuPet al. An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Ann Oper Res2016; 242(2): 303–320.
19.
Rodríguez-MartínISalazar-GonzálezJ-JYamanH.A branch-and-cut algorithm for the hub location and routing problem. Comput Oper Res2014; 50: 161–174.
