物流配送调度的干扰管理研究
|
摘要
带时间窗的车辆路径规划问题(VRPTW)是一个NP难题,求解十分困难。更为不幸的是,在物流配送过程中还经常发生对正常物流配送产生干扰和不良影响的事件。如何快速处理这些干扰事件,最大限度的减少干扰事件对企业整体物流配送工作的影响,就成了物流企业和学术界共同关注亟待解决的热点问题。
本文基于干扰管理思想,以第三方物流配送应对经常受到干扰事件影响的管理问题为研究对象,重点探讨物流配送的干扰管理理论及方法,提出并建立干扰管理模型并研究相应的快速求解算法。本文的主要工作如下：
(1)分析了对此类干扰事件进行多车互救的救援需求,从实际配送系统的运行特点出发,提出了多车互救策略,即“同路”、“邻近”和“增派”救援策略,简化了模型的求解。根据不同类型的配送系统车辆调度干扰管理问题的特点,提出了针对车辆调度干扰管理问题中备选车辆的搜索空间范围的简化策略,使搜索空间得到简化,并针对不同的需求对搜索空间进行分组,以简化问题的求解。
(2)针对客户时间窗变动问题,提出基于干扰管理思想构建扰动恢复策略和方案。应用虚拟多车场实现车辆调度扰动恢复问题转化,提出车辆调度扰动恢复策略和扰动度量方法,以作为车辆调度干扰管理建模的基础；分析顾客时间窗和发货量变化造成的扰动并进行辨识,建立干扰管理模型,提出归一化处理办法对原始问题进行有效兼容；结合干扰管理模型的特点,改进基于顾客的编码表示方法,可以反映出车辆调度扰动恢复策略；根据干扰管理思想,设计遗传算法对干扰管理模型进行求解。给出了一个具有代表性的算例试验结果,算例结果及其分析表明干扰管理模型和遗传算法的有效性。
(3)针对带回程取货车辆路径问题中客户需求变动问题,如出现新的服务请求、客户点减少及其货物量增加或减少等,基于干扰管理的思想,从定性和定量两个方面对这些干扰事件进行分析和度量,提出了车辆调度的扰动恢复模型；设计了基于邻近策略和增派策略的启发式算法对模型进行求解；并用实例数据进行了验证。
(4)分析了带时间窗服务型车辆路径问题中物流配送运力受扰的救援需求,基于干扰管理思想建立了服务型车辆路径问题扰动恢复模型；对车辆受损的带时间窗服务型车辆路径问题提出了救援策略,并设计了混合使用以上救援策略的启发式算法；最后对实施这救援策略的效果进行了分析和比较。
Logistics distribution vehicle routing problem with time windows belongs to a typical NP-Hard problem. In addition, all kinds of disruptions occur in the actual logistic activities. These disruptions disturb the original optimal routing solution, impact on serving customers on time and make service quality and service efficiency decline. Therefore, it is very necessary and meaningful to quickly and efficiently handle disruptions which emerge during the logistics distribution vehicle routing problem.
As a methodology of handling disruptions in real time, disruption management chiefly settles such kind of incidents that happens frequently. Based on the concept of disruption management, the recovery model and its algorithm are researched. The main researches in this paper are as follows:
(1) After analyzed the differences and the settling demands in the sorts of vehicle routing problem with disruptions, three rescuing strategies, namely the same way rescue strategy, nearby rescue strategy and addition rescue strategy, are proposed to slove the disruption problem. Besides, according to the disruption management, the predigestion strategies are put forward to predigest the search space.
(2) To tackle the disruption caused by the customer time window changes in the logistics, the disruption recovery solution is given based on the theory of disruption management. The transformation method for the disruption recovery of the vehicle routing problem is proposed based on multiple depots, and the disruption recovery strategies and the methods of deviation measurement are given, which is the basis of the disruption management modeling for the vehicle routing problem. For the disruption management of vehicle routing problem with the request changes of customers, the disruption is illustrated, the disruption management model is constructed, and the normalization processing for the model is given, making the model compatible with VRPTW. The chromosome code based on customer is ameliorated and the genetic algorithm is designed. A representative result and the analysis are given in this paper, and the experiment indicates the validity of the model and algorithm.
(3) Demand changes in vehicle routing problem with backhaul are researched, such as new requests, requests of canceling service and increase/decrease in the quantity from backhauls. And based on disruption management thoughts, demand changes are analyzed, their impact on the original plan is measured, and a disruption recovery model for the problem is put forward. Then two strategies and heuristics algorithm are designed. Finally, benchmark data are used to test. And results show the effectiveness of the model and the algorithm.
(4) From the disruption management point of view, the rescue requirements are analyzed, model for the problem with a broken-down vehicle in VRPTW with servicing distribution are proposed and the strategies are given. The algorithm founded on the strategies above is designed. Finally, the performance of these strategies are analyzed and compared.
本文基于干扰管理思想,以第三方物流配送应对经常受到干扰事件影响的管理问题为研究对象,重点探讨物流配送的干扰管理理论及方法,提出并建立干扰管理模型并研究相应的快速求解算法。本文的主要工作如下：
(1)分析了对此类干扰事件进行多车互救的救援需求,从实际配送系统的运行特点出发,提出了多车互救策略,即“同路”、“邻近”和“增派”救援策略,简化了模型的求解。根据不同类型的配送系统车辆调度干扰管理问题的特点,提出了针对车辆调度干扰管理问题中备选车辆的搜索空间范围的简化策略,使搜索空间得到简化,并针对不同的需求对搜索空间进行分组,以简化问题的求解。
(2)针对客户时间窗变动问题,提出基于干扰管理思想构建扰动恢复策略和方案。应用虚拟多车场实现车辆调度扰动恢复问题转化,提出车辆调度扰动恢复策略和扰动度量方法,以作为车辆调度干扰管理建模的基础；分析顾客时间窗和发货量变化造成的扰动并进行辨识,建立干扰管理模型,提出归一化处理办法对原始问题进行有效兼容；结合干扰管理模型的特点,改进基于顾客的编码表示方法,可以反映出车辆调度扰动恢复策略；根据干扰管理思想,设计遗传算法对干扰管理模型进行求解。给出了一个具有代表性的算例试验结果,算例结果及其分析表明干扰管理模型和遗传算法的有效性。
(3)针对带回程取货车辆路径问题中客户需求变动问题,如出现新的服务请求、客户点减少及其货物量增加或减少等,基于干扰管理的思想,从定性和定量两个方面对这些干扰事件进行分析和度量,提出了车辆调度的扰动恢复模型；设计了基于邻近策略和增派策略的启发式算法对模型进行求解；并用实例数据进行了验证。
(4)分析了带时间窗服务型车辆路径问题中物流配送运力受扰的救援需求,基于干扰管理思想建立了服务型车辆路径问题扰动恢复模型；对车辆受损的带时间窗服务型车辆路径问题提出了救援策略,并设计了混合使用以上救援策略的启发式算法；最后对实施这救援策略的效果进行了分析和比较。
Logistics distribution vehicle routing problem with time windows belongs to a typical NP-Hard problem. In addition, all kinds of disruptions occur in the actual logistic activities. These disruptions disturb the original optimal routing solution, impact on serving customers on time and make service quality and service efficiency decline. Therefore, it is very necessary and meaningful to quickly and efficiently handle disruptions which emerge during the logistics distribution vehicle routing problem.
As a methodology of handling disruptions in real time, disruption management chiefly settles such kind of incidents that happens frequently. Based on the concept of disruption management, the recovery model and its algorithm are researched. The main researches in this paper are as follows:
(1) After analyzed the differences and the settling demands in the sorts of vehicle routing problem with disruptions, three rescuing strategies, namely the same way rescue strategy, nearby rescue strategy and addition rescue strategy, are proposed to slove the disruption problem. Besides, according to the disruption management, the predigestion strategies are put forward to predigest the search space.
(2) To tackle the disruption caused by the customer time window changes in the logistics, the disruption recovery solution is given based on the theory of disruption management. The transformation method for the disruption recovery of the vehicle routing problem is proposed based on multiple depots, and the disruption recovery strategies and the methods of deviation measurement are given, which is the basis of the disruption management modeling for the vehicle routing problem. For the disruption management of vehicle routing problem with the request changes of customers, the disruption is illustrated, the disruption management model is constructed, and the normalization processing for the model is given, making the model compatible with VRPTW. The chromosome code based on customer is ameliorated and the genetic algorithm is designed. A representative result and the analysis are given in this paper, and the experiment indicates the validity of the model and algorithm.
(3) Demand changes in vehicle routing problem with backhaul are researched, such as new requests, requests of canceling service and increase/decrease in the quantity from backhauls. And based on disruption management thoughts, demand changes are analyzed, their impact on the original plan is measured, and a disruption recovery model for the problem is put forward. Then two strategies and heuristics algorithm are designed. Finally, benchmark data are used to test. And results show the effectiveness of the model and the algorithm.
(4) From the disruption management point of view, the rescue requirements are analyzed, model for the problem with a broken-down vehicle in VRPTW with servicing distribution are proposed and the strategies are given. The algorithm founded on the strategies above is designed. Finally, the performance of these strategies are analyzed and compared.
引文
[1]Yu G, Qi X. Disruption management:framework, models and applications [M]. U.S.:World Scientific Publishing Co. Pte. Ltd.,2004.
[2]Clausen J, Jesper H, Jesper L et al. Disruption management [J]. OR/MS,2001,28(5):40-43.
[3]陈安,李铭禄.干扰管理、危机管理和应急管理概念辨析[J].应急管理汇刊,2006,1(1)：8-9.
[4]胡祥培,丁秋雷,张漪,王旭坪.干扰管理研究评述[J].管理科学,2007,20(2)：2-8.
[5]马辉,林晨.航班调度应急管理研究[J].中国民航学院学报,2005,23(25)：12-14.
[6]Philip T. Evers. Filling customer orders from multiple locations:A comparison of pooling methods. Journal of Business Logistics [J].1999,20(l):121-140.
[7]M Hong-Minh, S M Disney, M M Naim. The dynamics of emergency transshipment supply chains [J]. International Journal of Physical Distribution & Logistics Management,2000,30(9):788-817.
[8]P B Mirchandani, J-Q Li, D Borenstein. Real-time logistic recovery under schedule disruptions [C]. The 2005 IEEE International Conference on Service Operation and Logistics, and Informatics Program Schedule, Beijing, China,2005.
[9]J Q Li, D Borenstein, P B Mirchandani. A decision support system for the single-depot vehicle rescheduling problem [J]. Computers & Operations Research,2007,34(4):1008-1032.
[10]C A Hane, C Barnhart, E L Johnson et al. The fleet assignment problem:solving a large-scale integer program[J]. Mathematical Programming,1995,70(2):211-232.
[11]Yu G, Arguello M, Song M et al. A new era for crew recovery at continental airlines[J]. Interfaces, 2003,33(1):5-22.
[12]Jan Ehrhoff, Sven Grothklags, Ulf Lorenz. Playing the repair game:disruption management and robust plans [J]. Dynamically Evolving, Large-scale Information Systems. Project Number:001907,2004.
[13]Li Ping, Xu Bing, Gu Xin-yi. Research on forecast model of schedule risk for project of uncertain network [C]. International Engineering Management Conference, Singapore,2004.
[14]罗守成.计划评审技术中的延误惩罚问题[J].上海第二工业大学学报,2005,22(5)：28-32.
[15]D Teodorovic, S Guberinic. Optimal dispatching strategy on an airline network after a schedule perturbation [J]. European Journal of Operational Research,1984,15(2):178-182.
[16]Gou Wei, Gang Yu, Mark Song. Optimization model and algorithm for crew management during airline irregular operations [J]. Journal of Combinatorial Optimization,1997,1(3):305-321.
[17]P. Kouvelis, G. Yu. Robust discrete optimization and its applications [M]. London:Kluwer Academic Publishers,1997.
[18]P Kouvelis, R L Daniels, G Vairaktarakis. Robust scheduling of a two-machine flow shop with uncertain processing times [J]. ⅡE Transactions on Scheduling and Logistics,2000,32(5):421-432.
[19]T Andersson. The flight perturbation problem-operational aircraft rescheduling [D]. Lic. Thesis No. 920, Linkoping University of Technology, Campus Norrkoping,2001.
[20]T Stutzle. Iterated Local Search for the Quadratic Assignment Problem [N]. Technical report, Technische Hochschule Darmstadt,1999.
[21]N Mladenovic, P Hansen. Variable neighborhood search [J]. Computers & Operations Research,1997, 24(11):1097-1100.
[22]Michael Love, Kim Riis S(?)rensen, Jesper Larsen et al. Disruption management for an airline-rescheduling of aircraft [J]. Applications of Evolutionary Computing,2002,2279(3):315-324.
[23]李军,郭耀煌.物流配送车辆优化调度理论[M].北京：中国物资出版社,2001.
[24]Bodin L D, GoldenB L.Routing and scheduling of vehicles and crews:the state of art [J]. Computers&Operations Research,1983,10:63-211.
[25]Ho W K, Ang J C, Andrew L. A hybrid search algorithm for the vehicle routing problem with time window [J]. International Journal on ArtiFicial Intelligence Tools,2001,10(3):431-439.
[26]袁庆达,杜文,周再玲.带软时间窗的混合车队车辆路线问题的模型和算法研究[J].西南交通大学学报,2001,36(4)：401-406.
[27]郭耀煌,李军.车辆优化调度问题的研究现状评述[J].西南交通大学学报,1995,30(4)：376-382.
[28]Hwang H S. An improved model for vehicle routing problem with time constraint based on genetic algorithm [J]. Computers&Industrial Engineering,2002,42:361-369.
[29]Paolo T, Daniele V.Models relaxations and exact approaches for the capacitated vehicle routing problem [J]. Discrete Applicated Mathematics,2002,123:487-512.
[30]Ferland J A, Michelon P. The vehicle scheduling problem with multiple vehicle types [J]. Journal of Operational Reseruch Society,1988,39:577-583.
[31]Toth, Paolo, Vigo. Exact algorithm for the vehicle routing problem with backhauls [J]. Transportation Science,1997,31 (4):372-385.
[32]Basnet C, Foulds, Wilson. Heuristic for vehicle routing on tree like networks [J]. Journal of Operational Research Society,1999,50(6):627-635.
[33]James P K, Xu J F. A set-partitioning based heuristic for the VSP [J]. Journal on Computing,1999, 11(2):161-172.
[34]Bramel J, Simcilevi D. A location based heuristic for general routing problems [J]. Operations Research,1995,43:649-660.
[35]Federgruen A, Van R. Probabilistic analysis of a combined aggregation and programming heuristic for general class of vehicle routing and scheduling problems [J]. Management Science,1997,43(8):1060-1078.
[36]李军.车辆调度问题的分派启发式算法[J].系统工程理论与实践,1999,19(1)：27-33.
[37]李大卫,王莉,王梦光.一个求解带有时间窗口约束的车辆路径问题的启发式算法[J].系统工程,1998,16(4)：20-24.
[38]Cesar R. A subpath ejection method for the vehicle routing problem [J]. Management Science,1998, 44(10):1447-1459.
[39]Barbarosoglu, Gulay, Wilson. Tabu search algorithm for the vehicle routing problem [J]. Computers & Operations Research,1999,26(3):255-270.
[40]Goetschalckx M, Jacobs-Blecha C. The vehicle routing problem with backhauls:properties and solution algorithm [N].Technical report MHRC-TR-88-13, Georgia Institute of Technology, Atlanta,1993.
[41]Deif I, L Bodin. Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling [J]. The Babson Conference on Software in Trandportation and Logistic Management, Babson,1984:75-96.
[42]Clarke G, Wright J W. Scheduling of vehicle from a central depot to a number of delivery points [J]. Operational Research,1964,12(4):568-581.
[43]M Gendreau, A Hertz, G Laporte. Traveling salesman problem with backhauls [J]. Computers and Operations Research,1996,23(2):501-508.
[44]M Gendreau, A Hertz, G Laporte. An approximation algorithm for the traveling salesman problem with backhauls [J]. Operations Research,1997,45(4):639-641.
[45]Ghaziri H., Osman I H. A neural network algorithm for the traveling salesman problem with backhauls [J]. Computers and Industrial Engineering,2003,44(2):267-281.
[46]Goetschalckx M, C Jacobs-Blecha. The vehicle routing problem with backhauls[J]. European Journal of Operational Research,1989,42(1):39-51.
[47]Toth P, Vigo D. A heurisitc algorithm for the vehicle routing problem with backhauls [J]. Advanced Methods In Transportation Analysis, Springer Verlag, Berlin,1996:585-608.
[48]Toth P, Vigo D. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls [J]. European Journal of Operational Research,1999,113(3):528-544.
[49]A Mingozzi, S Giorgi, R Baldacci. An exact method for the vehicle routing problem with backhauls [J]. Transportation Science,1999,33(3):315-329.
[50]J. Crispim, J. Brandao. Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhaul [C]. The 4th Metaheuristics International Conference, Porto, Portugal, 2001:631-636.
[51]C Carreto, B Baker. An improved GRASP interactive approach for the vehicle routing problem with backhauls [C]. The 4th Metaheuristics International Conference, Porto, Portugal,2001:227-230.
[52]H Ghaziri, I H Osman. Self-organizing feature maps for the vehicle routing problem with backhauls [J]. Journal of Scheduling,2006,9(2):97-114.
[53]Jianhua Fan, Xiufeng Wang, Qiushuang Chen. A Heuristic Algorithm for Multiple Depots Vehicle Routing Problem with Backhauls [C]. The Fourth International Conference of Fuzzy Systems and Knowledge Discovery, Haikou, China,2007:421-425.
[54]B L Golden, E Baker, J Alfaro et al. The vehicle routing problem with backhauling:two approaches [C]. The XII Annual Meeting of S.F. TIMS, Myrtle Beach, SC,1985:90-92.
[55]D O Casco, B L Golden, E A Wasil. Vehicle routing with backhauls:models, Algorithms, and case studies[J]. Vehicle Routing:Methods and Studies,1988:127-147.
[56]Salhi S, G Nagy. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling [J]. Journal of the Operational Research Society,1999,50(10):1034-1042.
[57]Wade A C, Salhi S. An investigation into a new class of vehicle routing problem with backhauls [J]. Omega,2002,30(6):479-487.
[58]J-F Chen, T-H Wu. Vehicle routing problem with simultaneous deliveries and pickups [J]. Journal of the Operational Research Society,2006,57(5):579-587.
[59]隆颖.带回程取货的车辆路径若干问题研究[D].沈阳：东北大学硕士学位论文,2005.
[60]郭伏,隆颖.带时间窗回程取货的车辆路径问题的算法[J].东北大学学报(自然科学版),2006,27(5)：575-578.
[61]Tutuncu G Y, Carreto C, Baker B.M. A visual interactive approach to classical and mixed vehicle routing problems with backhauls [J]. Omega, doi:10.1016/j.omega.2006.
[62]S Ropke, D Pisinger. An unifed heuristic for a large class of vehicle routing problems with backhauls [J]. European Journal of Operational Research,2006,171(3):750-775.
[63]R Tavakkoli-Moghaddam, A R Saremi, M S Ziaee. A memetic algorithm for a vehicle routing problem with backhauls [J]. Applied Mathematics and Computation,2006,181(2):1049-1060.
[64]陈幼林.考虑回程的车辆配送模型研究[D].上海：同济大学博士学位论文,2006.
[65]Anne W, Said S. An ant system algorithm for the vehicle routing problem with backhauls [C].4th Metaheuristics International Conference, Porto, Portugal,2001:199-203.
[66]吴泰熙,陈正芳,徐俊诚.含取货之车辆途程问题解法之研究[J].工业工程学报,2003,20(6)：651-665.
[67]隆颖.用遗传算法求解带回程取货的车辆路径问题[J].辽宁师专学报,2005,7(3)：87-88.
[68]Jose Brandao. A new tabu search algorithm for the vehicle routing problem with backhauls [J]. European Journal of Operational Research,2006,173(2):540-555.
[69]S R Thangiah, J Y Potvin, T Sun. Heuristic approaches to vehicle routing with backhauls and time windows [J]. Computers and Operations Research,1996,23(11):1043-1057.
[70]Duhamel C, Jean-Yves Potvinn, Jean-Marc Rousseau. A tabu search heuristic for the vehicle routing problem with backhauls and time windows [J]. Transportation Science,1997,31(1):49-59.
[71]Hasama T, Kokubugata H, Kawashima H. A heuristic approach based on the string model to solve vehicle routing problem with backhauls [C]. The 5th World Congress on Intelligent Transport Systems, Korea,1998:25-32.
[72]M Reimann, K Doerner, R F Hartl. Insertion based ants for vehicle routing problems with backhauls and time windows[J]. Ant Algorithms,2002,135-148.
[73]Yingjie Zhong, Michael H Cole. A vehicle routing problem with backhauls and time windows:a guided local search solution [J]. Transportation Research Part E,2005,41(2):131-144.
[74]Yuh-Jen Cho. Threshold accepting meta-heuristic for the vehicle routing problem with backhauls and time windows [J]. Journal of the Eastern Asia Society for Transportation Studies,2005,6:3022-3037.
[75]尹传忠,卜雷,蒲云等.带回送和时间窗的车辆路径问题的模型及算法[J].西南交通大学学报,2006,41(3)：290-295.
[76]张燕,周支立,翟斌.集货送货一体化的物流配送车辆路径问题的标号算法[J].运筹与管理,2007,16(3)：12-19.
[77]胡大伟,陈诚,王来军.带硬时间窗车辆路线问题的混合遗传启发式算法[J].交通运输工程学报,2007,7(05)：112-117.
[78]李建,张永,达庆利.第三方物流多车型硬时间窗路线问题研究[J].系统工程学报,2008,23(01)：74-80.
[79]B. Philippe, G.Francois,1, G. Miche, Y. P. Jean. A parallel tabu search heuristic for the vehicle routing problem with time windows[J]. Transportation Research Part C:Emerging Technologies,1997,5(2):109-122.
[80]S. C. Ho, D. Haugland. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries [J]. Computers & Operations Research,2004,31(12):947-964.
[81]L. B. Alexandre, G. C.Teodor. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows [J]. Computers & Operations Research,2005,32(7):1685-1708.
[82]宾松,符卓.求解带软时间窗的车辆路径问题的改进遗传算法[J].系统工程,2003,21(6)：12-15.
[83]邓爱民,毛超,周彦霆.带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J].系统工程理论与实践,2009,29(5)：186-192.
[84]N. Balakrishnan. Simple heuristics for the vehicle routing problem with soft time windows [J]. The Journal of the Operational Research Society,1993,44(3):279-287.
[85]I. George, K. Manolis, P. Gregory. A problem generator-solver heuristic for vehicle routing with soft time windows [J]. Omega,2003,23(1):41-53.
[86]H.I. Calvete, C. Gale, M. Oliveros, B. Sanchez-Valverde. A goal programming approach to vehicle routing problems with soft time windows [J]. European Journal of Operational Research,2007,177(3): 1720-1733.
[87]Jiafu Tang, Zhendong Pan, Richard Y.K.Fung, Henry Lau. Vehicle routing problem with fuzzy time windows [J]. Fuzzy Sets and Systems,2009,160(5):683-695.
[88]陆琳,谭清美.模糊信息动态车辆调度优化问题研究[J].中国管理科学,2006,14(z1)：156-160.
[89]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报,2005,8(3)：64-71.
[90]王旭坪,傅克俊,胡祥培.应急物流系统及其快速反应机制研究[J].中国软科学,2005,6：127-131.
[91]傅克俊,王旭坪,胡祥培.基于突发事件的物流配送过程建模构想[J].物流技术,2005,10：263-266.
[92]Wang X P, Niu J, Hu X P. Intelligent decision support system of disruption management in logistics scheduling[C]. Proceedings of 11th International Symposium on Logistics, Beijing China,2006:398-401.
[93]张漪,胡祥培,许智超.物流干扰管理研究评述[C],2006物流系统工程学术年会论文集,大连,2006：57-65.
[94]Eglese R W, Maden W,Slater A. A road timetable to aid vehicle routing and scheduling [J]. Computers and Operations Research,2006,33:3508-3519.
[95]王明春,高成修,曾永廷.VRPTW的扰动恢复及其TABU SEARCH算法[J].数学杂志,2006,26(2)：231-236.
[96]谢秉磊,郭耀煌,郭强.动态车辆路径问题：现状与展望[J].系统工程理论方法应用,2002,11(2)：116-120.
[97]Minkoff A S. A markov decision model and decomposition heuristic for dynamics vehicle dispatching [J]. Operations Research,1993,41(01):77-90.
[98]Peter M D,Bertsimas D J,Odoni A R. Models and algorithms for transient queueing congestionat airports[J]. Management Science,1995,41:1279-1295.
[99]Swihart M R,Papastavrou. A stochastic and dynamic model for the single-vehicle pick up and delivery problem[J]. European Journal of Operational Research,1999,114(3):447-464.
[100]Bertsimas D J, Ryzin G V. A stochastic and dynamic Vehicle routing problem in the euclide an plane[J]. Operations Research,1991,39(3):601-615.
[101]Bertsimas D J, Ryzin G V. Stochastic and dynamic Vehicle routing problem in the eucidean plane with multiple capacitated vehicles [J]. Operations Research,1993,41(2):60-76.
[102]Paletta G. A multi-period traveling salesman problem:heuristic algorithm[J]. Computer & Operations Research,1992,19:789-795.
[103]柳伍生.实时订货信息下物流配送车辆调度优化研究[D].湖南长沙：长沙理工大学硕士学位论文,2004.
[104]Freling R, Wagelmans A, Paixao J. Models and algorithms for single-depot vehicle scheduling[J]. Transportation Science,2001,35(2):165-180.
[105]Li J Q, Mirchandani P B, Borenstein D. Parallel auction algorithm for bus rescheduling [C]. Proceedings of 9th International Conference on Computer-Aided Scheduling of Public Transport.San Diego,
California, USA,2004.
[106]张育宏.商用车辆应急调度研究[D].北京：北京工业大学硕士学位论文,2005.
[107]朱志军,徐寅峰,刘春草.局内车辆选线问题和竞争策略分析[J].系统工程学报,2003,18(4)：324-330.
[108]胡茂林,徐寅峰,徐维军.堵塞点可恢复型的在线运输车辆的调度策略研究[J].系统工程学报,2006,21(5)：484-489.
[109]Bel 1 W, Dalberto L M, Fisher M L, et al. Imporoving the distribution of industrial gases w with an online computerized routing optimizer [J]. Interface,1983,13:4-23.
[110]PsaralLis H N. A dynamic programming solution the single vehicle many-to-many Immediate request DIAL-A-RIDE problem [J]. Transportation Science,1980,14:130-154.
[111]Mardsen O B G, Ravn H F, Voelds J. A heuristic method ror dispatching repairmen [C]. Annals of Operations Research,1995,61:193-208.
[112]Gendreau M, Guerlin F, Polvin J Y, et al. Tahu search ror real-time vehicle routing and dispatching [N]. Technical Report CRT96-47, Centre de Recherche Sur Les Transports, University de MonLreal,1996.
[113]Gendreau M, GuerLin F,Potvin J Y,et al. Parallel tahu search for real-time vehicle routing and dispatching [J]. Transportation Science,1996,33:381-390.
[114]谢秉磊.随机车辆路径问题研究[D].四川：西南交通大学博士学位论文,2003.
[115]Freling R, Wagelmans A, Paixao J. Models and algorithms for single-depot vehicle scheduling [J]. Transportation Science,2001,35:165-80.
[116]SONG J, HU J, TIAN Y, et al. Re-optimization in Dynamic Vehicle Routing Problem Based on Wasp-like Agent Strategy[C]. Proceedings of the 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria,2005:688-693.
[117]李宁,邹彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践,2004,4：130-135.
[118]Warren B, Powel L,Michael T,et al. On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance [J]. Transportation science,2000,34(1): 67-85.
[]19]邹彤,李宁,孙德宝.不确定车辆数的有时间窗车辆路径问题的遗传算法[J].系统工程理论与实践,2004,24(6)：134-138.
[120]邹彤,李宁,孙德宝等.多车场车辆路径问题的遗传算法[J].计算机工程与应用.2004,40(21)：82-83.
[121]游进军,纪昌明,付湘.基于遗传算法的多目标问题求解方法[J].水利学报,2003,(7)：64-69.
[122]Runwei Cheng, Mitsuo Gen, Tatsumi Tozawa. Vehicle Routing Problem with Fuzzy Due-time Using Genetic Algorithms [J]. Japan Society for Fuzzy Theory and Systems,1995,7(5):1050-1061.
[123]钟石泉.物流配送车辆调度智能优化方法研究[D].天津：天津大学.2004.
[124]Kennedy J, Eberhart R C. Particle swarm optimization [C]. Proceedings IEEE International Conference on Neural Networks, Piscataway, NJ:IEEE Service Center,1995:1942-1948.
[125]Eberhart R C, Shi Y. Particle swarm optimization:developments,applications and resources [C]. Proceedings Congress on Evolutionary Computation 2001. Piscataway, NJ:IEEE Press,2001:81-86.
[126]http://web.cba.neu.edu/-msolomon/problems.htm
[127]戴锡.车辆路线问题的二阶段启发式算法及其在现代物流配送中的应用[D].上海：复旦大学博士学位论文,2004.
[2]Clausen J, Jesper H, Jesper L et al. Disruption management [J]. OR/MS,2001,28(5):40-43.
[3]陈安,李铭禄.干扰管理、危机管理和应急管理概念辨析[J].应急管理汇刊,2006,1(1)：8-9.
[4]胡祥培,丁秋雷,张漪,王旭坪.干扰管理研究评述[J].管理科学,2007,20(2)：2-8.
[5]马辉,林晨.航班调度应急管理研究[J].中国民航学院学报,2005,23(25)：12-14.
[6]Philip T. Evers. Filling customer orders from multiple locations:A comparison of pooling methods. Journal of Business Logistics [J].1999,20(l):121-140.
[7]M Hong-Minh, S M Disney, M M Naim. The dynamics of emergency transshipment supply chains [J]. International Journal of Physical Distribution & Logistics Management,2000,30(9):788-817.
[8]P B Mirchandani, J-Q Li, D Borenstein. Real-time logistic recovery under schedule disruptions [C]. The 2005 IEEE International Conference on Service Operation and Logistics, and Informatics Program Schedule, Beijing, China,2005.
[9]J Q Li, D Borenstein, P B Mirchandani. A decision support system for the single-depot vehicle rescheduling problem [J]. Computers & Operations Research,2007,34(4):1008-1032.
[10]C A Hane, C Barnhart, E L Johnson et al. The fleet assignment problem:solving a large-scale integer program[J]. Mathematical Programming,1995,70(2):211-232.
[11]Yu G, Arguello M, Song M et al. A new era for crew recovery at continental airlines[J]. Interfaces, 2003,33(1):5-22.
[12]Jan Ehrhoff, Sven Grothklags, Ulf Lorenz. Playing the repair game:disruption management and robust plans [J]. Dynamically Evolving, Large-scale Information Systems. Project Number:001907,2004.
[13]Li Ping, Xu Bing, Gu Xin-yi. Research on forecast model of schedule risk for project of uncertain network [C]. International Engineering Management Conference, Singapore,2004.
[14]罗守成.计划评审技术中的延误惩罚问题[J].上海第二工业大学学报,2005,22(5)：28-32.
[15]D Teodorovic, S Guberinic. Optimal dispatching strategy on an airline network after a schedule perturbation [J]. European Journal of Operational Research,1984,15(2):178-182.
[16]Gou Wei, Gang Yu, Mark Song. Optimization model and algorithm for crew management during airline irregular operations [J]. Journal of Combinatorial Optimization,1997,1(3):305-321.
[17]P. Kouvelis, G. Yu. Robust discrete optimization and its applications [M]. London:Kluwer Academic Publishers,1997.
[18]P Kouvelis, R L Daniels, G Vairaktarakis. Robust scheduling of a two-machine flow shop with uncertain processing times [J]. ⅡE Transactions on Scheduling and Logistics,2000,32(5):421-432.
[19]T Andersson. The flight perturbation problem-operational aircraft rescheduling [D]. Lic. Thesis No. 920, Linkoping University of Technology, Campus Norrkoping,2001.
[20]T Stutzle. Iterated Local Search for the Quadratic Assignment Problem [N]. Technical report, Technische Hochschule Darmstadt,1999.
[21]N Mladenovic, P Hansen. Variable neighborhood search [J]. Computers & Operations Research,1997, 24(11):1097-1100.
[22]Michael Love, Kim Riis S(?)rensen, Jesper Larsen et al. Disruption management for an airline-rescheduling of aircraft [J]. Applications of Evolutionary Computing,2002,2279(3):315-324.
[23]李军,郭耀煌.物流配送车辆优化调度理论[M].北京：中国物资出版社,2001.
[24]Bodin L D, GoldenB L.Routing and scheduling of vehicles and crews:the state of art [J]. Computers&Operations Research,1983,10:63-211.
[25]Ho W K, Ang J C, Andrew L. A hybrid search algorithm for the vehicle routing problem with time window [J]. International Journal on ArtiFicial Intelligence Tools,2001,10(3):431-439.
[26]袁庆达,杜文,周再玲.带软时间窗的混合车队车辆路线问题的模型和算法研究[J].西南交通大学学报,2001,36(4)：401-406.
[27]郭耀煌,李军.车辆优化调度问题的研究现状评述[J].西南交通大学学报,1995,30(4)：376-382.
[28]Hwang H S. An improved model for vehicle routing problem with time constraint based on genetic algorithm [J]. Computers&Industrial Engineering,2002,42:361-369.
[29]Paolo T, Daniele V.Models relaxations and exact approaches for the capacitated vehicle routing problem [J]. Discrete Applicated Mathematics,2002,123:487-512.
[30]Ferland J A, Michelon P. The vehicle scheduling problem with multiple vehicle types [J]. Journal of Operational Reseruch Society,1988,39:577-583.
[31]Toth, Paolo, Vigo. Exact algorithm for the vehicle routing problem with backhauls [J]. Transportation Science,1997,31 (4):372-385.
[32]Basnet C, Foulds, Wilson. Heuristic for vehicle routing on tree like networks [J]. Journal of Operational Research Society,1999,50(6):627-635.
[33]James P K, Xu J F. A set-partitioning based heuristic for the VSP [J]. Journal on Computing,1999, 11(2):161-172.
[34]Bramel J, Simcilevi D. A location based heuristic for general routing problems [J]. Operations Research,1995,43:649-660.
[35]Federgruen A, Van R. Probabilistic analysis of a combined aggregation and programming heuristic for general class of vehicle routing and scheduling problems [J]. Management Science,1997,43(8):1060-1078.
[36]李军.车辆调度问题的分派启发式算法[J].系统工程理论与实践,1999,19(1)：27-33.
[37]李大卫,王莉,王梦光.一个求解带有时间窗口约束的车辆路径问题的启发式算法[J].系统工程,1998,16(4)：20-24.
[38]Cesar R. A subpath ejection method for the vehicle routing problem [J]. Management Science,1998, 44(10):1447-1459.
[39]Barbarosoglu, Gulay, Wilson. Tabu search algorithm for the vehicle routing problem [J]. Computers & Operations Research,1999,26(3):255-270.
[40]Goetschalckx M, Jacobs-Blecha C. The vehicle routing problem with backhauls:properties and solution algorithm [N].Technical report MHRC-TR-88-13, Georgia Institute of Technology, Atlanta,1993.
[41]Deif I, L Bodin. Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling [J]. The Babson Conference on Software in Trandportation and Logistic Management, Babson,1984:75-96.
[42]Clarke G, Wright J W. Scheduling of vehicle from a central depot to a number of delivery points [J]. Operational Research,1964,12(4):568-581.
[43]M Gendreau, A Hertz, G Laporte. Traveling salesman problem with backhauls [J]. Computers and Operations Research,1996,23(2):501-508.
[44]M Gendreau, A Hertz, G Laporte. An approximation algorithm for the traveling salesman problem with backhauls [J]. Operations Research,1997,45(4):639-641.
[45]Ghaziri H., Osman I H. A neural network algorithm for the traveling salesman problem with backhauls [J]. Computers and Industrial Engineering,2003,44(2):267-281.
[46]Goetschalckx M, C Jacobs-Blecha. The vehicle routing problem with backhauls[J]. European Journal of Operational Research,1989,42(1):39-51.
[47]Toth P, Vigo D. A heurisitc algorithm for the vehicle routing problem with backhauls [J]. Advanced Methods In Transportation Analysis, Springer Verlag, Berlin,1996:585-608.
[48]Toth P, Vigo D. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls [J]. European Journal of Operational Research,1999,113(3):528-544.
[49]A Mingozzi, S Giorgi, R Baldacci. An exact method for the vehicle routing problem with backhauls [J]. Transportation Science,1999,33(3):315-329.
[50]J. Crispim, J. Brandao. Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhaul [C]. The 4th Metaheuristics International Conference, Porto, Portugal, 2001:631-636.
[51]C Carreto, B Baker. An improved GRASP interactive approach for the vehicle routing problem with backhauls [C]. The 4th Metaheuristics International Conference, Porto, Portugal,2001:227-230.
[52]H Ghaziri, I H Osman. Self-organizing feature maps for the vehicle routing problem with backhauls [J]. Journal of Scheduling,2006,9(2):97-114.
[53]Jianhua Fan, Xiufeng Wang, Qiushuang Chen. A Heuristic Algorithm for Multiple Depots Vehicle Routing Problem with Backhauls [C]. The Fourth International Conference of Fuzzy Systems and Knowledge Discovery, Haikou, China,2007:421-425.
[54]B L Golden, E Baker, J Alfaro et al. The vehicle routing problem with backhauling:two approaches [C]. The XII Annual Meeting of S.F. TIMS, Myrtle Beach, SC,1985:90-92.
[55]D O Casco, B L Golden, E A Wasil. Vehicle routing with backhauls:models, Algorithms, and case studies[J]. Vehicle Routing:Methods and Studies,1988:127-147.
[56]Salhi S, G Nagy. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling [J]. Journal of the Operational Research Society,1999,50(10):1034-1042.
[57]Wade A C, Salhi S. An investigation into a new class of vehicle routing problem with backhauls [J]. Omega,2002,30(6):479-487.
[58]J-F Chen, T-H Wu. Vehicle routing problem with simultaneous deliveries and pickups [J]. Journal of the Operational Research Society,2006,57(5):579-587.
[59]隆颖.带回程取货的车辆路径若干问题研究[D].沈阳：东北大学硕士学位论文,2005.
[60]郭伏,隆颖.带时间窗回程取货的车辆路径问题的算法[J].东北大学学报(自然科学版),2006,27(5)：575-578.
[61]Tutuncu G Y, Carreto C, Baker B.M. A visual interactive approach to classical and mixed vehicle routing problems with backhauls [J]. Omega, doi:10.1016/j.omega.2006.
[62]S Ropke, D Pisinger. An unifed heuristic for a large class of vehicle routing problems with backhauls [J]. European Journal of Operational Research,2006,171(3):750-775.
[63]R Tavakkoli-Moghaddam, A R Saremi, M S Ziaee. A memetic algorithm for a vehicle routing problem with backhauls [J]. Applied Mathematics and Computation,2006,181(2):1049-1060.
[64]陈幼林.考虑回程的车辆配送模型研究[D].上海：同济大学博士学位论文,2006.
[65]Anne W, Said S. An ant system algorithm for the vehicle routing problem with backhauls [C].4th Metaheuristics International Conference, Porto, Portugal,2001:199-203.
[66]吴泰熙,陈正芳,徐俊诚.含取货之车辆途程问题解法之研究[J].工业工程学报,2003,20(6)：651-665.
[67]隆颖.用遗传算法求解带回程取货的车辆路径问题[J].辽宁师专学报,2005,7(3)：87-88.
[68]Jose Brandao. A new tabu search algorithm for the vehicle routing problem with backhauls [J]. European Journal of Operational Research,2006,173(2):540-555.
[69]S R Thangiah, J Y Potvin, T Sun. Heuristic approaches to vehicle routing with backhauls and time windows [J]. Computers and Operations Research,1996,23(11):1043-1057.
[70]Duhamel C, Jean-Yves Potvinn, Jean-Marc Rousseau. A tabu search heuristic for the vehicle routing problem with backhauls and time windows [J]. Transportation Science,1997,31(1):49-59.
[71]Hasama T, Kokubugata H, Kawashima H. A heuristic approach based on the string model to solve vehicle routing problem with backhauls [C]. The 5th World Congress on Intelligent Transport Systems, Korea,1998:25-32.
[72]M Reimann, K Doerner, R F Hartl. Insertion based ants for vehicle routing problems with backhauls and time windows[J]. Ant Algorithms,2002,135-148.
[73]Yingjie Zhong, Michael H Cole. A vehicle routing problem with backhauls and time windows:a guided local search solution [J]. Transportation Research Part E,2005,41(2):131-144.
[74]Yuh-Jen Cho. Threshold accepting meta-heuristic for the vehicle routing problem with backhauls and time windows [J]. Journal of the Eastern Asia Society for Transportation Studies,2005,6:3022-3037.
[75]尹传忠,卜雷,蒲云等.带回送和时间窗的车辆路径问题的模型及算法[J].西南交通大学学报,2006,41(3)：290-295.
[76]张燕,周支立,翟斌.集货送货一体化的物流配送车辆路径问题的标号算法[J].运筹与管理,2007,16(3)：12-19.
[77]胡大伟,陈诚,王来军.带硬时间窗车辆路线问题的混合遗传启发式算法[J].交通运输工程学报,2007,7(05)：112-117.
[78]李建,张永,达庆利.第三方物流多车型硬时间窗路线问题研究[J].系统工程学报,2008,23(01)：74-80.
[79]B. Philippe, G.Francois,1, G. Miche, Y. P. Jean. A parallel tabu search heuristic for the vehicle routing problem with time windows[J]. Transportation Research Part C:Emerging Technologies,1997,5(2):109-122.
[80]S. C. Ho, D. Haugland. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries [J]. Computers & Operations Research,2004,31(12):947-964.
[81]L. B. Alexandre, G. C.Teodor. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows [J]. Computers & Operations Research,2005,32(7):1685-1708.
[82]宾松,符卓.求解带软时间窗的车辆路径问题的改进遗传算法[J].系统工程,2003,21(6)：12-15.
[83]邓爱民,毛超,周彦霆.带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J].系统工程理论与实践,2009,29(5)：186-192.
[84]N. Balakrishnan. Simple heuristics for the vehicle routing problem with soft time windows [J]. The Journal of the Operational Research Society,1993,44(3):279-287.
[85]I. George, K. Manolis, P. Gregory. A problem generator-solver heuristic for vehicle routing with soft time windows [J]. Omega,2003,23(1):41-53.
[86]H.I. Calvete, C. Gale, M. Oliveros, B. Sanchez-Valverde. A goal programming approach to vehicle routing problems with soft time windows [J]. European Journal of Operational Research,2007,177(3): 1720-1733.
[87]Jiafu Tang, Zhendong Pan, Richard Y.K.Fung, Henry Lau. Vehicle routing problem with fuzzy time windows [J]. Fuzzy Sets and Systems,2009,160(5):683-695.
[88]陆琳,谭清美.模糊信息动态车辆调度优化问题研究[J].中国管理科学,2006,14(z1)：156-160.
[89]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报,2005,8(3)：64-71.
[90]王旭坪,傅克俊,胡祥培.应急物流系统及其快速反应机制研究[J].中国软科学,2005,6：127-131.
[91]傅克俊,王旭坪,胡祥培.基于突发事件的物流配送过程建模构想[J].物流技术,2005,10：263-266.
[92]Wang X P, Niu J, Hu X P. Intelligent decision support system of disruption management in logistics scheduling[C]. Proceedings of 11th International Symposium on Logistics, Beijing China,2006:398-401.
[93]张漪,胡祥培,许智超.物流干扰管理研究评述[C],2006物流系统工程学术年会论文集,大连,2006：57-65.
[94]Eglese R W, Maden W,Slater A. A road timetable to aid vehicle routing and scheduling [J]. Computers and Operations Research,2006,33:3508-3519.
[95]王明春,高成修,曾永廷.VRPTW的扰动恢复及其TABU SEARCH算法[J].数学杂志,2006,26(2)：231-236.
[96]谢秉磊,郭耀煌,郭强.动态车辆路径问题：现状与展望[J].系统工程理论方法应用,2002,11(2)：116-120.
[97]Minkoff A S. A markov decision model and decomposition heuristic for dynamics vehicle dispatching [J]. Operations Research,1993,41(01):77-90.
[98]Peter M D,Bertsimas D J,Odoni A R. Models and algorithms for transient queueing congestionat airports[J]. Management Science,1995,41:1279-1295.
[99]Swihart M R,Papastavrou. A stochastic and dynamic model for the single-vehicle pick up and delivery problem[J]. European Journal of Operational Research,1999,114(3):447-464.
[100]Bertsimas D J, Ryzin G V. A stochastic and dynamic Vehicle routing problem in the euclide an plane[J]. Operations Research,1991,39(3):601-615.
[101]Bertsimas D J, Ryzin G V. Stochastic and dynamic Vehicle routing problem in the eucidean plane with multiple capacitated vehicles [J]. Operations Research,1993,41(2):60-76.
[102]Paletta G. A multi-period traveling salesman problem:heuristic algorithm[J]. Computer & Operations Research,1992,19:789-795.
[103]柳伍生.实时订货信息下物流配送车辆调度优化研究[D].湖南长沙：长沙理工大学硕士学位论文,2004.
[104]Freling R, Wagelmans A, Paixao J. Models and algorithms for single-depot vehicle scheduling[J]. Transportation Science,2001,35(2):165-180.
[105]Li J Q, Mirchandani P B, Borenstein D. Parallel auction algorithm for bus rescheduling [C]. Proceedings of 9th International Conference on Computer-Aided Scheduling of Public Transport.San Diego,
California, USA,2004.
[106]张育宏.商用车辆应急调度研究[D].北京：北京工业大学硕士学位论文,2005.
[107]朱志军,徐寅峰,刘春草.局内车辆选线问题和竞争策略分析[J].系统工程学报,2003,18(4)：324-330.
[108]胡茂林,徐寅峰,徐维军.堵塞点可恢复型的在线运输车辆的调度策略研究[J].系统工程学报,2006,21(5)：484-489.
[109]Bel 1 W, Dalberto L M, Fisher M L, et al. Imporoving the distribution of industrial gases w with an online computerized routing optimizer [J]. Interface,1983,13:4-23.
[110]PsaralLis H N. A dynamic programming solution the single vehicle many-to-many Immediate request DIAL-A-RIDE problem [J]. Transportation Science,1980,14:130-154.
[111]Mardsen O B G, Ravn H F, Voelds J. A heuristic method ror dispatching repairmen [C]. Annals of Operations Research,1995,61:193-208.
[112]Gendreau M, Guerlin F, Polvin J Y, et al. Tahu search ror real-time vehicle routing and dispatching [N]. Technical Report CRT96-47, Centre de Recherche Sur Les Transports, University de MonLreal,1996.
[113]Gendreau M, GuerLin F,Potvin J Y,et al. Parallel tahu search for real-time vehicle routing and dispatching [J]. Transportation Science,1996,33:381-390.
[114]谢秉磊.随机车辆路径问题研究[D].四川：西南交通大学博士学位论文,2003.
[115]Freling R, Wagelmans A, Paixao J. Models and algorithms for single-depot vehicle scheduling [J]. Transportation Science,2001,35:165-80.
[116]SONG J, HU J, TIAN Y, et al. Re-optimization in Dynamic Vehicle Routing Problem Based on Wasp-like Agent Strategy[C]. Proceedings of the 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria,2005:688-693.
[117]李宁,邹彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践,2004,4：130-135.
[118]Warren B, Powel L,Michael T,et al. On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance [J]. Transportation science,2000,34(1): 67-85.
[]19]邹彤,李宁,孙德宝.不确定车辆数的有时间窗车辆路径问题的遗传算法[J].系统工程理论与实践,2004,24(6)：134-138.
[120]邹彤,李宁,孙德宝等.多车场车辆路径问题的遗传算法[J].计算机工程与应用.2004,40(21)：82-83.
[121]游进军,纪昌明,付湘.基于遗传算法的多目标问题求解方法[J].水利学报,2003,(7)：64-69.
[122]Runwei Cheng, Mitsuo Gen, Tatsumi Tozawa. Vehicle Routing Problem with Fuzzy Due-time Using Genetic Algorithms [J]. Japan Society for Fuzzy Theory and Systems,1995,7(5):1050-1061.
[123]钟石泉.物流配送车辆调度智能优化方法研究[D].天津：天津大学.2004.
[124]Kennedy J, Eberhart R C. Particle swarm optimization [C]. Proceedings IEEE International Conference on Neural Networks, Piscataway, NJ:IEEE Service Center,1995:1942-1948.
[125]Eberhart R C, Shi Y. Particle swarm optimization:developments,applications and resources [C]. Proceedings Congress on Evolutionary Computation 2001. Piscataway, NJ:IEEE Press,2001:81-86.
[126]http://web.cba.neu.edu/-msolomon/problems.htm
[127]戴锡.车辆路线问题的二阶段启发式算法及其在现代物流配送中的应用[D].上海：复旦大学博士学位论文,2004.