[1] Krajewska M A, Kopfer H. Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem[J]. European Journal of Operational Research, 2009, 197(2): 741-751. [2] Veenstra M, Roodbergen K J, Coelho L C, et al. A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands[J]. European Journal of Operational Research, 2018, 268(2): 703-715. [3] Drexl M, Schneider M. A survey of variants and extensions of the location-routing problem[J]. European Journal of Operational Research, 2015, 241(2):283-308. [4] Karaoglan I, Altiparmak F, Kara I, et al. The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach[J]. Omega, 2012, 40(4):465-477. [5] Escobar J W, Linfati R, Baldoquin M G, et al. A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem[J]. Transportation Research Part B Methodological, 2014, 67(9):344-356. [6] 陈义友, 张锦, 罗建强. 顾客选择行为对自提点选址的影响研究[J]. 中国管理科学, 2017, 25(5): 135-144.Chen Yiyou, Zhang Jin, Luo Jianqiang. The impact of customers’ choice behavior on pickup point location[J]. Chinese Journal of Management Science, 2017, 25(5): 135-144. [7] 符卓, 刘文, 邱萌. 带软时间窗的需求依订单拆分车辆路径问题及其禁忌搜索算法[J]. 中国管理科学, 2017, 25(5): 78-86.Fu Zhuo, Liu Wen, Qiu Meng. A tabu search algorithm for the vehicle routing problem with soft time windows and split deliveries by order[J]. Chinese Journal of Management Science, 2017, 25(5): 78-86. [8] Stenger A, Schneider M, Schwind M, et al. Location routing for small package shippers with subcontracting options[J]. International Journal of Production Economics, 2010, 140(2):702-712. [9] Salari M, Naji-Azimi Z. An integer programming-based local search for the covering salesman problem[J]. Computers & Operations Research, 2012, 39(11): 2594-2602. [10] Hachicha M, Hodgson M J, Laporte G,et al. Heuristics for the multi-vehicle covering tour problem[J]. Computers & Operations Research, 2000, 27(1): 29-42. [11] Ha M H, Bostel N, Langevin A, et al. An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices[J]. European Journal of Operational Research, 2013, 226(2): 211-220. [12] Naji-Azimi Z, Renaud J, Ruiz A, et al. A covering tour approach to the location of satellite distribution centers to supply humanitarian aid[J]. European Journal of Operational Research, 2012, 222(3):596-605. [13] Schneider M, Stenger A, Goeke D. The electric vehicle-routing problem with time windows and recharging stations[J]. Transportation Science, 2014, 48(4): 500-520. [14] Schneider M, Stenger A, Hof J. An adaptive VNS algorithm for vehicle routing problems with intermediate stops[J]. OR Spectrum, 2015, 37(2): 353-387. [15] 郭放, 杨珺, 杨超. 考虑充电策略与电池损耗的电动汽车路径优化问题研究[J]. 中国管理科学, 2018, 26(9): 106-118.Guo Fang, Yang Jun, Yang Chao. Study on the electric vehicle routing problem in the present of charging strategy and battery consumption[J]. Chinese Journal of Management Science, 2018, 26(9): 106-118. [16] Li Ying, Zhang Pengwei, Wu Yifan. Public recharging infrastructure location strategy for promoting electric vehicles: A bi-level programming approach[J]. Journal of Cleaner Production, 2018, 172: 2720-2734. [17] 郭放, 杨珺, 杨超. 考虑差异化服务时间的多车型电动汽车路径优化与充电策略研究[J]. 中国管理科学, 2019, 27(8): 118-128.Guo Fang, Yang Jun, Yang Chao. Study on heterogeneous electric vehicle routing and battery charging problem with the consideration of differentiated service cost[J]. Chinese Journal of Management Science, 2019, 27(8): 118-128. [18] Niu Yunyun, Yang Zehua, Chen Ping, et al. Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost[J]. Journal of Cleaner Production, 2018, 171: 962-971. [19] Keskin M. Partial recharge strategies for the electric vehicle routing problem with time windows[J]. Transportation Research Part C: Emerging Technologies, 2016, 65: 111-127. [20] Koc C, Bektas T, Jabali O, et al. The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm[J]. European Journal of Operational Research, 2016, 248(1): 33-51. [21] Desaulniers G, Errico F, Irnich S, et al. Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows.[J]. Operations Research, 2016, 64:págs. 1388-1405. [22] Gimenezgaydou D A, Ribeiro A S N, Gutierrez J, et al. Optimal location of battery electric vehicle charging stations in urban areas: A new approach[J]. International Journal of Sustainable Transportation, 2016, 10(5): 393-405.. [23] Augerat P, Belenguer J M, Benavent E, et al. Computational results with a branch and cut code for the capacitated vehicle routing problem[J]. Rapport de recherche- IMAG,1995. [24] Rinaldi G, Yarrow L A. Optimizing a 48-city traveling salesman problem: A case study in combinatorial problem solving[M]. New York University, Graduate School of Business Administration,1985. [25] Taillard é. Parallel iterative search methods for vehicle routing problems[J]. Networks, 1993, 23(8): 661-673.
|