[1] Dumas Y, Desrosiers J, Soumis F. The pickup and delivery problem with time windows[J]. European Journal of Operational Research, 1991, 54(1): 7-22. [2] Savelsbergh M W P, Solomon M. The general pickup and delivery problem[J]. Transportation Science, 1995, 29(1): 17-29. [3] Li H, Lim A. A metaheuristic for the pickup and delivery problem with time windows[C]//13th IEEE Inter-national Conference on Tools with Artificial Intelligence, IEEE Computer Society, Los Alamitos, CA, 2001: 333-340. [4] Pankratz G. A grouping genetic algorithm for the pickup and delivery problem with time windows[J]. Operation Research Spectrum, 2005, 27(1): 21-41. [5] Bent R, Van H P. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows[J]. Computer Operation Research, 2006, 33(4): 875-893. [6] Ropke S, Cordeau J F. Branch-and-cut-and-price for the pickup and delivery problem with time windows[J]. Transportation Science, 2009, 43(3): 267-286. [7] Hosny M I, Mumford C L. The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms[J]. Journal of Heuristics, 2010, 16(3): 417-439. [8] Wang C, Mu D, Zhao F, et al. A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows[J]. Computers & Industrial Engineering, 2015, 83(C): 111-122. [9] Nguyen P K, Crainic T G, Toulouse M. Multi-trip pickup and delivery problem with time windows and synchronization[J]. Annals of Operations Research, 2016: 1-36. [10] Nalepa J, Blocho M. Enhanced guided ejection search for the pickup and delivery problem with time windows[C]//Asian Conference on Intelligent Information and Database Systems. Springer, Berlin, Heidelberg, 2016. 388-398. [11] Phan D H, Suzuki J. Evolutionary multiobjective optimization for the pickup and delivery problem with time windows and demands[J]. Mobile Networks & Applications, 2016, 21(1): 175-190. [12] 李玲,谷寒雨,陈坚.复杂PDPTW问题的插入启发式算法[J].计算机工程,2003,29(16):65-66,144. [13] 贾永基,谷寒雨,席裕庚.求解PDPTW问题的一种快速禁忌搜索算法[J].控制与决策,2004,19(1):57-60. [14] 贾永基,谷寒雨,席裕庚.单车独占性带时间窗口装卸货问题的分析与算法[J].上海交通大学学报,2005,39(3):409-412. [15] Jia Y J, Gu H Y, Xi Y G. Rolling horizon scheduling algorithm for dynamic vehicle scheduling system[J]. Journal of Southeast University(English edition), 2005, 21(1): 92-96. [16] 蓝伯雄,张跃.求解带时间窗的装-卸载问题的概率式禁忌搜索算法[J].中国管理科学,2004,12(2):66-72. [17] 郭伏,隆颖.带时窗回程取货的车辆路径问题的算法[J].东北大学学报(自然科学版),2006,27(5):575-578. [18] 郭伏,隆颖,赵希男.取送货混排的车辆路径问题的模糊动态研究[J].东北大学学报(自然科学版),2007,28(10):1505-1508. [19] 郑四发,曹剑东,连小珉.复杂路网下多客户间最短路径的扇面Dijkstra算法[J].清华大学学报(自然科学版),2009,49(11):1834-1837. [20] 潘立军,符卓.求解带时间窗取送货问题的遗传算法[J].系统工程理论与实践,2012,32(1):120-126. [21] Dantzig G B, Wolfe P. The decomposition algorithm for linear programs[J]. Econometrica, 1961, 29(4): 767-778. [22] Xu H, Chen Z L, Rajagopal S, et al. Solving a practical pickup and delivery problem[J]. Transportation Science, 2003, 37(3): 347-364. [23] Sigurd M, Pisinger D, Sig M. Scheduling transportation of live animals to avoid the spread of diseases[J]. Transportation Science, 2004, 38(2): 197-209. |