[1] 郝建彬."新零售"的曙光[J]. 互联网经济,2016(11):12-15. (HAO J B. The dawn of "new retail"[J]. The Internet Economy, 2016(11):12-15.) [2] DANTZIG G B, RAMSER J H. The truck dispatching problem[J]. Management Science, 1959, 6(1):80-91. [3] KUMAR S N, PANNEERSELVAM R. A survey on the vehicle routing problem and its variants[J]. Intelligent Information Management, 2012, 4(3):66-74. [4] 曹二宝,赖明勇,聂凯,等.大规模物流配送车辆调度问题研究[J].湖南大学学报(自然科学版),2007,34(12):89-92. (CAO E B, LAI M Y, NIE K, et al. Research on large-scale vehicle routing problem of logistics-distribution[J]. Journal of Hunan University (Natural Sciences), 2007, 34(12):89-92.) [5] EWBANK H, WANKE P, HADI-VENCHEH A. An unsupervised fuzzy clustering approach to the capacitated vehicle routing problem[J]. Neural Computing and Applications, 2016, 27(4):857-867. [6] SHIN K, HAN S. A centroid-based heuristic algorithm for the capacitated vehicle routing problem[J]. Computing & Informatics, 2011, 30(4):721-732. [7] 谭颖,胡瑞飞,殷国富.多密度阈值的DBSCAN改进算法[J].计算机应用,2008,28(3):745-748. (TAN Y, HU R F, YIN G F. Adapted DBSCAN with multi-threshold[J]. Journal of Computer Applications, 2008, 28(3):745-748.) [8] VAZ PENNA P H, SUBRAMANIAN A, OCHI L S. An iterated local search heuristic for the heterogeneous fleet vehicle routing problem[J]. Journal of Heuristics, 2013, 19(2):201-232. [9] ROPKE S, PISINGER D. A unified heuristic for a large class of vehicle routing problems with backhauls[J]. European Journal of Operational Research, 2006, 171(3):750-775. [10] GRANGIER P, GENDREAU M, LEHUÉDÉ F, et al. An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization[J]. European Journal of Operational Research, 2014, 254(1):80-91. [11] AZI N, GENDREAU M, POTVIN J-Y. An adaptive large neighborhood search for a vehicle routing problem with multiple routes[J]. Computers & Operations Research, 2014, 41(1):167-173. [12] GHILAS V, DEMIR E, VAN WOENSEL T. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines[J]. Computers & Operations Research, 2016, 72:12-30. [13] YU V F, LIN S-Y. A simulated annealing heuristic for the open location-routing problem[J]. Computers & Operations Research, 2015, 62(C):184-196. [14] NEO. VRP Instances[EB/OL].[2017-02-17]. http://neo.lcc.uma.es/vrp/vrp-instances/. [15] HASSANI A H E, BOUHAFS L, KOUKAM A. A hybrid ant colony system approach for the capacitated vehicle routing problem and the capacitated vehicle routing problem with time windows[M]//Vehicle Routing Problem.[S.l.]:InTechOpen., 2008:58-70. [16] TASAN A S, GEN M. A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries[J]. Computers & Industrial Engineering, 2012, 62(3):755-761. [17] TEOH B E, PONNAMBALAM S G, KANAGARAJ G. Differential evolution algorithm with local search for capacitated vehicle routing problem[J]. International Journal of Bio-Inspired Computation, 2015, 7(5):321-342. |