[1] 倪玲霖, 史峰, 方晓平,等. 全连通快递网络与轴辐快递网络的比较[J].系统工程, 2009, 27(12): 45-50.
NI Linglin, SHI Feng, FANG Xiaoping,et al. Comparative study on fully-connected and hub-and-spoke express operational network[J]. Systems Engineering, 2009,27(12):45-50.
[2] 杨忠振, 陆婧. 轴-辐式机场长途巴士线网运营时刻表优化设计[J]. 系统工程理论与实践, 2012, 32(9): 2050-2056.
YANG Zhongzhen, LU Jing. Optimization of the timetable for a hub-spoke airport coach network[J].Systems Engineering-Theory & Practice, 2012, 32(9): 2050-2056.
[3] ADLERA N,SMILOWITZB K. Hub-and-spoke network alliances and mergers: price-location competition in the airline industry[J]. Transportation Research Part B: Methodological, 2007,41(4):394-409.
[4] ABDINNOUR-HELM S. A hybrid heuristic for the uncapacitated hub location problem[J]. European Journal of Operational Research,1998,106(2/3):489-499.
[5] ERNST A T, KRISHNAMOORTHY M. Efficient algorithms for the uncapacitated single allocation p-hub median problem[J]. Location Science,1996,4(3):139-154.
[6] ERNST A T,KRISHNAMOORTHY M. Solution algorithms for the capacitated single allocation hub location problem[J]. Annals of Operations Research,1999,86(1):141-159.
[7] LABBé M, YAMAN H. Projecting the flow variables for hub location problems[J]. Networks,2004,44(2):84-93.
[8] LABBé M, YAMAN H, GOURDIN E. A branch and cut algorithm for hub location problems with single assignment[J].Mathematical Programming,2005,102(2):371-405.
[9] PIRKUL H,SCHILLING D A. An efficient procedure for designing single allocation hub and spoke systems[J]. Management Science,1998,44(12):235-242.
[10]SKORIN-KAPOV D, SKORIN-KAPOV J. On tabu search for the location of interacting hub facilities[J]. European Journal of Operational Research,1994,73(3):502-509.
[11]BOLAND N, KRISHNAMOORTHY M, ERNST A T, et al. Preprocessing and cutting for multiple allocation hub location problems[J]. European Journal of Operational Research,2004,155(3):638-653.
[12]CONTRERAS I, FERNNDEZ E, MARN A. Tight bounds from a path based formulation for the tree of hub location problem[J]. Computers & Operations Research,2009,36(12):3117-3127.
[13]CONTRERAS I, CORDEAU J F, LAPORTE G. Benders decomposition for large-scale uncapacitated hub location [J]. Operations Research,2011,59(6):1477-1490.
[14]EBERY J, KRISHNAMOORTHY M, ERNST A, et al. The capacitated multiple allocation hub location problem: formulations and algorithms[J]. European Journal of Operational Research,2000,120(3):614-631.
[15]ERNST A T, KRISHNAMOORTHY M. Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem[J]. European Journal of Operational Research,1998,104(1):100-112.
[16]HAMACHER H W, LABB M,NICKEL S. Adapting polyhedral properties from facility to hub location problems[J]. Discrete Applied Mathematics,2004,145(1):104-116.
[17]MARN A. Formulating and solving splittable capacitated multiple allocation hub location problems[J]. Computers & Operations Research,2005,32(12):3093-3109.
[18]MAYER G, WAGNER B. Hub locator: an exact solution method for the multiple allocation hub location problem[J]. Computers & Operations Research,2002,29(6):715-739.
[19]倪玲霖, 史峰.多分配快递轴辐网络的枢纽选择与分配优化方法[J].系统工程理论与实践,2012,32(2):441-448.
NI Linglin, SHI Feng. Hub location and allocation optimization of multiple allocation hub-and-spoke express networks[J]. Systems Engineering-Theory & Practice, 2012, 32(2):441-448.
[20]CAMPBELL J F. Integer programming formulations of discrete hub location problems[J]. European Journal of Operational Research,1994,72(2):387-405.
[21]CAMPBELL J F. Hub Location and the p-hub median problem[J]. Operations Research,1996,44(6):1-13.
[22]ERNST A T, KRISHNAMOORTHY M. An exact solution approach based on shortest-paths for p-hub median problems[J]. Informs Journal on Computing,1998,10(2):149-162 .
[23]O'KELLY M E, BRYAN D. Hub network design with single and multiple allocation: A computational study[J]. Location Science,1996,4(3):125-138.
[24]SKORIN-KAPOV D,SKORIN-KAPOV J,O'KELLY M. Tight linear programming relaxations of uncapacitated p-hub median problems[J]. European Journal of Operational Research,1996,94(3):582-593.
[25]CONTRERAS I, DAZ J A, FERNNDEZ E. Lagrangean relaxation for the capacitated hub location problem with single assignment[J]. OR Spectrum,2009,31(3):483-505.
[26]CORREIA I, NICKEL S,SALDANHA-DA-GAMA F. Hub and spoke network design with single-assignment, capacity decisions and balancing requirements[J]. Applied Mathematical Modelling, 2011, 35(10): 4841-4851.
[27]胡青蜜, 胡志华, 陶莎. 二级轴辐式零担物流网络设计的资源均衡利用问题[J].公路交通科技, 2013, 30(4): 124-131.
HU Qingmi, HU Zhihua, TAO Sha. Resource balanced usage problem for bi-level hub-and-spoke LTL logistics network design[J]. Journal of Highway and Transportation Research and Development, 2013, 30(4):124-131.
[28]ALUMUR S A, NICKEL S,SALDANHA-DA-GAMA F. Hub location under uncertainty[J]. Transportation Research Part B: Methodological,2012,46(4):529-543.
[29]CONTRERAS I, JEAN-FRANGOIS, LAPORTE G. Stochastic uncapacitated hub location[J]. European Journal of Operational Research,2011,212(3):518-528. |