[1] Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management science, 1959, 6(1): 80-91.[2] Bing Xiaoyun, de Keizer M, Bloemhof-Ruwaard J M, et al. Vehicle routing for the eco-efficient collection of household plastic waste[J]. Waste Management, 2014, 34(4): 719-729.[3] Wen Liang, Eglese R. Minimum cost VRP with time-dependent speed data and congestion charge[J]. Computers & Operations Research, 2015,56: 41-50.[4] Kalayci C B, Kaya C. An ant colony system empowerred variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery[J]. Expert Systems with Applications, 2016, 66: 163-175.[5] Lai D S W, Demirag O C, Leung J M Y. A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph[J]. Transportation Research Part E: Logistics and Transportation Review, 2016, 86: 32-52.[6] Jayaraman V, Patterson R A, Rolland E. The design of reverse distribution networks: Models and solution procedures[J]. European Journal of Operational Research, 2003, 150(1): 128-149.[7] Lo H K, Szeto W Y. Time-dependent transport network design under cost-recovery[J]. Transportation Research Part B: Methodological, 2009, 43(1): 142-158.[8] Dat L Q, Linh D T T, Chou S Y, et al. Optimizing reverse logistic costs for recycling end-of-life electrical and electronic products[J]. Expert Systems with Applications, 2012, 39(7): 6380-6387.[9] Demir E, Burgholzer W, Hrušovsky M, et al. A green intermodal service network design problem with travel time uncertainty[J]. Transportation Research Part B: Methodological, 2016,93(B):789-807.[10] 何波,杨超,张华.废弃物回收的多层逆向物流网络优化设计问题研究[J].中国管理科学,2007,15(3): 61-67.[11] 罗耀波,孙延明,廖鹏.带退货和软时间窗的多仓库选址-路径问题研究[J].运筹与管理,2014,23(5): 78-85.[12] 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: 344-356.[13] 代颖,马祖军,朱道立.震后应急物资配送的模糊动态定位-路径问题[J].管理科学学报,2012,(07):60-70.[14] 熊中楷,方衍,张聪誉.以旧换新收购方式下的逆向物流网络优化设计[J].中国管理科学, 2011,19(6):65-72.[15] Cai Xiaoqiang, Chen Jian, Xiao Yongbo, et al. Fresh-product supply chain management with logistics outsourcing[J].Omega,2013,41(4):752-765.[16] López-Sánchez A D, Hernández-Díaz A G, Vigo D, et al. A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem[J]. European Journal of Operational Research, 2014, 238(1): 104-113.[17] Marinakis Y, Marinaki M. A bumble bees mating optimization algorithm for the open vehicle routing problem[J]. Swarm and Evolutionary Computation, 2014, 15: 80-94.[18] 符卓. 带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究[J].系统工程理论与实践,2004, 24(3): 123-128.[19] 张江华,李进,高敏刚.同时集散货物的开放式车辆路径问题研究[J].中国管理科学, 2013, 21(4): 187-192.[20] Dorigo M,Di Caro G,Gambardella L M.Ant algorithms for discrete optimization[J]. Artificial life, 1999, 5(2): 137-172.[21] Santos L, Coutinho-Rodrigues J, Current J R. An improved ant colony optimization based algorithm for the capacitated arc routing problem[J]. Transportation Research Part B: Methodological, 2010, 44(2): 246-266.[22] 蔡婉君,王晨宇,于滨,等.改进蚁群算法优化周期性车辆路径问题[J].运筹与管理, 2014, 23(5): 70-77.[23] Schyns M. An ant colony system for responsive dynamic vehicle routing[J]. European Journal of Operational Research, 2015, 245(3): 704-718.[24] Kuo R J, Wibowo B S, Zulvia F E. Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time[J]. Applied Mathematical Modelling, 2016, 40(23): 9990-10001.[25] 张建勇,李军.具有同时配送和回收需求的车辆路径问题的混合遗传算法[J].中国公路学报,2006,19(4):118-122.[26] 马华伟,叶浩然,夏维.允许分割配送的多时间窗车辆调度问题的改进蚁群算法求解[J].中国管理科学,2012,(1):43-47 |