[1] Fisher M L. Vehicle routing with time window: two optimization algorithms[J]. Operations Research, 1997, 45(3): 488-492. [2] Osman I H. Metastrategy simulated annealing and tabu search algorithm for combinatorial optimization problems[J]. Annals of Operations Research, 1993, 41(3): 421-451. [3] Patrice Perny, Olivier Spanjaard. A preference-based approach to spanning trees and shortest paths problems[J]. European Journal of Operational Research, 2005, 162(3): 584-601. [4] 罗勇,陈治亚.基于改进遗传算法的物流配送路径优化[J].系统工程,2012,30(8):118-122. [5] Polacek M R, Hartl R F, Doerner K, et al. A variable neighborhood search for the multi depot vehicle routing problem with time windows[J]. Journal of Heuristics, 2004, 10(6): 613-627. [6] Cordeau J F, Laporte G, Mercier A. An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2004, 55(5): 542-546. [7] 李敏,郭强,刘红丽.多车场多配送中心的物流配送问题研究[J].计算机工程与应用,2007,43(8):202-204,208. [8] 李相勇,田澎.带时间窗和随机时间车辆路径问题:模型和算法[J].系统工程理论与实践,2009,29(8):81-90. [9] Oded Berman, Zvi Drezner, George Wesolowsky O. Satisfying partial demand in facilities location[J]. IIE Transactions, 2002, 34(11): 971-978. [10] Maro Vlachopoulou, George Silleos, Vassiliki Manthou. Geographic information system in warehouse site selection decisions[J]. International Journal of Production Economics, 2001, 71(1-3): 205-212. [11] 秦固.基于蚁群优化的多物流配送中心选址算法[J].系统工程理论与实践,2006,26(4):120-124. [12] 蒋忠中,汪定伟.B2C电子商务中配送中心选址优化的模型与算法[J].控制与决策,2005,20(10):1125-1128. [13] Albareda-Sambola M, Teodor Gabriel Crainic. A compact model and tight bounds for a combined location-routing problem[J]. Computers and Operations Research, 2005, 32(3): 407-428. [14] Christophe Duhamel, Philippe Lacomme, Christian Prins, et al. A GRASP×ELS approach for the capacitated location-routing problem[J]. Computers and Operations Research, 2010, 37(11): 1912-1923. [15] Hokey Min, Vaidyanathan Jayaraman, Rajesh Srivastava. Combined location routing problems: a synthesis and future research directions[J]. European Journal of Operational Research, 2001, 6(108): 1-15. [16] 张潜,高立群,胡祥培等.物流配送路径多目标优化的聚类-改进遗传算法[J].控制与决策,2003,18(4):418-422. [17] 于滨,靳鹏欢,杨忠振.两阶段启发式算法求解带时间窗的多中心车辆路径问题[J].系统工程理论与实践,2012,32(8):1793-1800. [18] Mirabi M, Fatemi Ghomi S M T, Jolai F. Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem[J]. Robotics and Computer-Integrated Manufacturing, 2010, 26(6): 564-569. [19] Subramanian A, Penna P H V, Uchoa E, et al. A hybrid algorithm for the heterogeneous fleet vehicle routing problem[J]. European Journal of Operational Research, 2012, 221(2): 285-295. [20] Barreto, Ferreira, Paix o, et al. Using clustering analysis in a capacitated location-routing problem[J]. European Journal of Operational Research, 2007, 179(3): 968-977. |