[1]Rodriguez V, Alvarez M J, Barcos L. Hub location under capacity constraints[J]. Transportation Research Part, 2007, 43(5):495-505.
[2]Silva M R, Cunha C B.New simple and efficient heuristics for the uncapacitated single allocation hub location problem[J]. Computers & Operations Research, 2009, 36(12):3152-3165.
[3]Hamacher H W, Labbe M, Nickel S, et al. Adapting polyhedral properties from facility to hub location problems[J]. Discrete Applied Mathematics, 2004, 145(1):104-116.
[4]Chen J F. A hybrid heuristic for the uncapacitated single allocation hub location problem[J]. Omega, 2007, 35(2): 211-220.
[5]Labbe 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.
[6]Marin A.Formulating and solving splittable capacitated multiple allocation hub location problems[J]. Computers & Operations Research, 2005,32(12):3093-3109.
[7]周和平, 晏克非, 徐汝华, 等. 基于遗传算法的公路网络设计的双层优化模型[J]. 同济大学学报(自然科学版),2005,33(7): 920-925. [ZHOU H P, YAN K F, XU R H, et al. Highway network design using bilevelprogramming model based on genetic algorithm[J].Journal of Tongji University(Natural Science), 2005,33(7):920-925.]
[8]王炜,邓卫,杨琪,等.公路网络规划建设与管理方法[M].北京:科技出版社,1997.[WANG W, DENG W, YANG Q, et al. Highway network planning, construction and management methods[M]. Beijing: Scientific and Technical Publishers, 1997.]
[9]Cunha Claudio B, Silva Marcos Roberto.A genetic algorithm for the problem of configuring a hubandspoke network for a LTL trucking company in Brazil[J]. European Journal of Operational Research, 2007(179):747-758. |