[1] 新浪汽车.公安部:17年底新能源汽车保有量达153万辆. http://auto.sina.com.cn/news/2018-01-16/detail-ifyqqieu6778118.shtml. 2018-01-16. [2] Chao I, Golden B, Wasil E. The team orienteering problem[J]. European Journal Operational Research, 1996, 88: 464-474. [3] Tang H, Miller-Hooks E. A tabu search heuristic for the team orienteering problem[J]. Computer and Operations Research, 2005, 32: 1379-1407. [4] Vansteenwegena P, Souffriaua W. Iterated local search for the team orienteering problem with time windows[J]. Computers &Operations Research, 2009(36): 3281-3290. [5] Archetti C, Hertz A, Speranza M. Metaheuristics for the team orienteering problem[J]. Journal of Heuristics, 2007, 13: 49-76. [6] 柯良军,尚可,冯祖仁.动态团队定向问题的模型及其优化算法[J].西安交通大学学报,2011,45(6):1-7. [7] Archetti C, Feillet D, Hertz A, Speranza M. The capacitated team orienteering and profitable tour problem[J]. Jounal of the Operational Research Society, 2008, 60 (6): 831-842. [8] Luo Z, Cheang B, Lim A, Zhu W B. An adaptive ejection pool with toggle-rule diversification approach[J]. European Journal of Operational Research, 2013(229): 673-682. [9] Vidal T, Maculan N, et al. Large neighborhoods with implicit customer selection for vehicle routing problem with profits[J]. Transportation Science, 2016(50): 720-734. [10] Righini G, Salani M. Dynamic programming for the orienteering problem with time windows[R]. Crema, Italy: University degli Study Milano, 2006. 91-93. [11] Montemanni R, Gambardella L. Ant colony system for team orienteering problems with time windows[J]. Foundations of computing and Decision Sciences, 2009, 34 (4): 287-306. [12] Ke L, Archetti C, Feng Z. Ants can solve the team orienteering problem[J]. Computers and Industrial Engineering, 2008, 54 (3): 648-665. [13] Souffriau W, Vansteenwegen P, Berghe G V, Van Oudheusden D. The multi constraint team orienteering problem with multiple time windows[J]. Transportation Science, 2013, 47(1): 53-63. [14] Tricoire F, Romauch M, Doerner K, Hartl R. Heuristics for the multi-period orienteering problem with multiple time windows[J]. Computers and Operations Research, 2010, 37(2): 351-367. [15] Mei Y, Salim F D, Li X. Efficient meta-heuristics for the multi-objective time-dependent orienteering problem[J]. European Journal of Operational Research, 2016, 254(2): 443-457. [16] Sun P, Veelenturf L P, Dabia S, et al. The time-dependent capacitated profitable tour problem with time windows and precedence constraints[J]. European Journal of Operational Research, 2017, 264(3): 1058-1073. [17] Golden B, Levy L, Vohra R. The orienteering problem[J]. Naval Research Logistics, 1987, 34: 307-318. [18] 陈萍,黄厚宽,董兴业.求解卸装一体化车辆路径问题的混合启发式算法[J].计算机学报,2008,31(4):1-9. [19] 张鹏威,李英.考虑充电设施重入的电动汽车旅行商问题研究[J].运筹与管理,2018,27(2):54-64. [20] 王道平,徐展,杨岑.基于两阶段启发式算法的物流配送选址-路径问题研究[J].运筹与管理,2017,26(4):70-75. [21] 王书勤,黄茜.军事定向越野路径优化问题建模及混合蚁群算法求解[J].运筹与管理,2018,27(4):105-111. |