[1] 李三彬, 柴玉梅, 王黎明. 需求可拆分的开放式车辆路径问题研究[J]. 计算机工程, 2011, 37(6): 168-171.[2] Sariklis D, Powell S. A Heuristic Method for the Open Vehicle Routing Problem[J]. Journal of the Operational Research Society, 2000, 51(5): 564-573.[3] Brandao J. A Tabu Search Algorithm for the Open Vehicle Routing Problem[J]. European Journal of Operational Research, 2004, 157(1): 552-564.[4] 符 卓. 带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究[J]. 系统工程理论与实践, 2004, 24(3): 123-128.[5] Fu Z, Eglese R, Li Lyo. A New Tabu Search Heuristic for the Open Vehicle Routing Problem[J]. Journal of the Operational Research Society, 2005, 56(3): 267-274.[6] Fu Z, Eglese R, Li Lyo. Corrigendum: A New Tabu Search Heuristic for the Open Vehicle Routing Problem[J]. Journal of the Operational Research Society, 2006, 57(8): 1018-1018.[7] Tarantilis C, Ioannou G, Kiranoudis C T, et al. A Threshold Accepting Approach to the Open Vehicle Routing Problem[J]. RAIRO Operations Research, 2004, 38(4): 345-360.[8] Pan Lijun, Fu Z. A Clone Selection Algorithm for the Open Vehicle Routing Problem[C]//Proc. of IEEE WGEC’09. [S. 1.]: IEEE Perss, 2009: 786-790.[9] Burnet F M. Clonal Selection Theory of Acquired Immunity[M]. [S. 1.]: Cambridge University Press, 1959.[10] de C L N, Von Z F J. Learning and Optimization Using the Clonal Selection Principle[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(3): 239-251.[11] 刘若辰, 杜海峰, 焦李成. 免疫多克隆策略[J]. 计算机研究与发展, 2004, 41(4): 571-576.[12] Pankratz G. A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows[C]//Proc. of OR’05. 2005: 21-41.[13] 潘立军, 符 卓. 求解带时间窗取送货问题的遗传算法[J]. 系统工程理论与实践, 2012, 32(1): 120-126. |