[1] SABAR N R, BHASKAR A, CHUNG E, et al. A selfadaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion[J]. Swarm and Evolutionary Computation, 2019, 26(44): 1018-1027.
[2] 张鹏乐, 肖开明, 符春晓, 等. 求解大规模VCVRP问题的快速动态规划算法[J]. 系统工程理论与实践, 2016, 36(3): 694-705. [ZHANG P L, XIAO K M, FU C X, et al. Fast dynamic programming algorithm for the large scale VCVRP problem[J]. Systems Engineering - Theory & Practice, 2016, 36(3): 694-705.]
[3] VOCCIA S A, CAMPBELL A M, THOMAS B W. The same-day delivery problem for online purchases[J]. Transportation Science, 2019, 53(1): 301-318.
[4] PUREZA V, LAPORTE G. Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows[J]. INFOR: Information Systems and Operational Research, 2008, 46(3): 165-175.
[5] FAGERHOLT K, FOSS B A, HORGEN O J. A decision support model for establishing an air taxi service: A case study[J]. Journal of the Operational Research Society, 2009, 60(9): 1173-1182.
[6] HERNANDES F, FEILLET D, GIROUDEAU R. Branch- and- price algorithms for the solution of the multi-trip vehicle routing problem with time windows [J]. European Journal of Operational Research, 2016, 249(2): 551-559.
[7] CATTARUZZA D, ABSI N, FEILLET D, et al. A memetic algorithm for the multi trip vehicle routing problem[J]. European Journal of Operational Research, 2014, 236(3): 833-848.
[8] 李建, 达庆利, 何瑞银. 多车次同时集散货物与路线问题研究[J]. 管理科学学报, 2010, 13(10): 1-7. [LI J, DA Q L, HE R Y. Research on the problem of multi-trip vehicle routing problem with simultaneous deliveries and pickups[J]. Journal of Management Sciences in China, 2010, 13(10): 1-7.]
[9] 宋强, 刘凌霞. 多行程车辆路径问题和配送中心定位问题的研究[J]. 数学的实践与认识, 2016, 46(7): 103- 113. [SONG Q, LIU L X. Research on multi-trip vehicle routing problem and distribution center location problem [J]. Journal of Mathematics in Practice and Theory, 2016, 46(7): 103-113.]
[10] NGUYENP K, CRAININC T G, TOULOUSE M. Multitrip pickup and delivery problem with time windows and synchronization[J]. Annals of Operations Research, 2017, 253(2): 899-934. |