应急物流配送车辆调度优化研究
|
摘要
近些年来,我国大规模突发性公共事件发生频繁,如1976年的唐山大地震、1998年的长江的大洪水、2003年的“SARS”、2005年的重庆毒气泄漏事件和松花江水的重大污染、“禽流感”、2008年初的南方雪灾、汶川大地震、甲型H1N1流感和2010年4月14日青海玉树发生的7.1级地震等突发事件造成的巨大损失,给人们留下了惨痛的记忆。现代社会的高速发展,使人口、资源、环境、公共卫生等各方面的社会问题日益尖锐,导致各类突发事件爆发更加频繁,危害加剧,受灾范围扩大。
应急物流是以提供自然灾害、公共事件等突发性公共事件处理过程中所需的应急救灾物资为目的,以追求时间效益最大化和灾害损失最小化为目标的特种物流活动。因此,在突发事件处置过程中,必须快速建立应急物流系统,保障突发灾害处置中所需的应急救援物资供应,以资解决或处理居民基本生活、死者安葬、伤者救助、卫生防疫、灾后重建、恢复生产、恢复秩序等事项,否则受灾面积、人员、损失将会持续扩大,灾害会变得更加严重。因此在突发事件发生时建立应急物流系统,迅速地将救援物资送达物资需求点,直接影响到整个突发性公共事件救援行动的成效。本文研究的应急物流车辆调度问题是在满足应急物流时间要求的前提下,更合理的安排车辆的运行路线,最大程度的节约运输成本对于提高应急物流效率是很有意义的。
本文首先分析了应急物流系统的特点、研究内容和运作流程。同时,就车辆调度问题进行了分析,介绍了车辆调度问题的提出、分类、典型问题的数学模型以及基本解决方法。并在此基础上提出了应急物流车辆调度问题,分析该问题与车辆调度问题(Vehicle Routing Problem, VRP)的区别,并建立了单车型、非满载、纯卸、单配送中心多受灾点的微观应急物流车辆调度优化问题的数学模型,同时选择了求解该问题的算法—蚁群算法(Ant Colony Optimization, ACO)。在应用蚁群算法对问题进行求解时,对蚁群算法的原理、特点、数学模型和算法实现步骤进行分析的基础上,针对算法的不足,分别通过对初始解的启发、状态转移规则和信息素更新策略的改进,改进了蚁群算法。并采用面向对象的C++语言对基本蚁群算法程序进行修改来对算例进行求解。结果证实了该算法在求解该类问题的可行性和有效性。
In recent years,China occurred a lot of large-scale public emergency frequently,such as the Tangshan earthquake in 1976,the worst flooding of Yangzi River in 1998,the crises of SARS in 2003,the poison gas leaked of Chongqing and the water serious pollutioned of Songhua River in 2005,the Avian Influernza,the south snow disaster in the beginning of 2008, the Wenchuan Earthquake,the influenza A virus subtype H1Nl,the recent 7.1 magnitude earthquake occurred in Qinghai Yushu on April 14,2010 and so on,which not only resulted in gigantic loses,but also left a deeply grieved memory in people's mind. Due to the high-speed development of modern society,the social problems about population,resource, environment public sanitation and so on become more incisively,and kinds of public emergencies occur more frequently,more dangerous and the influencing scope becomes much wider than before.
The emergency logistics system is a special logistic action in order to provide the emergency materials to deal with incidents,There are two aims that emergency logistics systems want to reach.The first is to dealing with incidents at the best early start-time,the second is to reduce the total cost of dealing with these sudden public incidents as it can. So when public emergency broke out,the emergency logistic must be established in order to supply abundant lash-up materials to resolve or deal with satisfying the essential demand of the residents, burying the death, rescuing the sound,sanitary engineering, the reestablishment after the bale, resuming production and getting back the order and so on; or else, the area of calamities and loss of live and assets would be expanded continuously. So that the establishment of emergency logistic when the emergency broke out could render the bailout materials be delivered to the spots where need them, which would have an effect upon the outcomes of the whole succor.This article studies the vehicle routing problem for emergency logistics distribution, which is based on satisfied the time limitied of emeregency materials distribution,the arrangement of vehicles’routing is more reasonable to ultimately reduce the cost of transportation,which is very meaningful for improving the efficiency of emergency logistic.
Firstly, this article proposed and analyzed the concept of emergency logistics and the characteristics,the research content and the operation flow of logistics system.Meanwhile, the article analyzed the related problems of vehicle routing problem,including the introduction,the classification,the mathematical model of typical problems and the basic solution methods. Based on the discussion of Vehicle Routing Problem (VRP) and emergency logistics,this article proposed the vehicle routing problem for emergency logistics distribution.And then,it analyzed the differences between this problem and VRP problem,and established the typical mathematical model of the VRP of unfully loaded emergency logistics distribution,simultane-ously chose Ant Colony Optimization(ACO) to solve this article solved the problem by ACO, it analyzed ACO's principle,characteristic,and established its mathematical model and then analyzed the executive steps of the algorithm's.Based on the analyses before and the defects of ACO in this article,through the inspiration of the initial solution,it updated the pheromone on the choice of strategy and pobability of transfer to mend ACO.At the end of this paper, object-oriented C++ language was applied to compile the computational procedure to improved ACO to carry the example. The result confirmed this algorithm is feasible and valid for solving this kind of problem.
应急物流是以提供自然灾害、公共事件等突发性公共事件处理过程中所需的应急救灾物资为目的,以追求时间效益最大化和灾害损失最小化为目标的特种物流活动。因此,在突发事件处置过程中,必须快速建立应急物流系统,保障突发灾害处置中所需的应急救援物资供应,以资解决或处理居民基本生活、死者安葬、伤者救助、卫生防疫、灾后重建、恢复生产、恢复秩序等事项,否则受灾面积、人员、损失将会持续扩大,灾害会变得更加严重。因此在突发事件发生时建立应急物流系统,迅速地将救援物资送达物资需求点,直接影响到整个突发性公共事件救援行动的成效。本文研究的应急物流车辆调度问题是在满足应急物流时间要求的前提下,更合理的安排车辆的运行路线,最大程度的节约运输成本对于提高应急物流效率是很有意义的。
本文首先分析了应急物流系统的特点、研究内容和运作流程。同时,就车辆调度问题进行了分析,介绍了车辆调度问题的提出、分类、典型问题的数学模型以及基本解决方法。并在此基础上提出了应急物流车辆调度问题,分析该问题与车辆调度问题(Vehicle Routing Problem, VRP)的区别,并建立了单车型、非满载、纯卸、单配送中心多受灾点的微观应急物流车辆调度优化问题的数学模型,同时选择了求解该问题的算法—蚁群算法(Ant Colony Optimization, ACO)。在应用蚁群算法对问题进行求解时,对蚁群算法的原理、特点、数学模型和算法实现步骤进行分析的基础上,针对算法的不足,分别通过对初始解的启发、状态转移规则和信息素更新策略的改进,改进了蚁群算法。并采用面向对象的C++语言对基本蚁群算法程序进行修改来对算例进行求解。结果证实了该算法在求解该类问题的可行性和有效性。
In recent years,China occurred a lot of large-scale public emergency frequently,such as the Tangshan earthquake in 1976,the worst flooding of Yangzi River in 1998,the crises of SARS in 2003,the poison gas leaked of Chongqing and the water serious pollutioned of Songhua River in 2005,the Avian Influernza,the south snow disaster in the beginning of 2008, the Wenchuan Earthquake,the influenza A virus subtype H1Nl,the recent 7.1 magnitude earthquake occurred in Qinghai Yushu on April 14,2010 and so on,which not only resulted in gigantic loses,but also left a deeply grieved memory in people's mind. Due to the high-speed development of modern society,the social problems about population,resource, environment public sanitation and so on become more incisively,and kinds of public emergencies occur more frequently,more dangerous and the influencing scope becomes much wider than before.
The emergency logistics system is a special logistic action in order to provide the emergency materials to deal with incidents,There are two aims that emergency logistics systems want to reach.The first is to dealing with incidents at the best early start-time,the second is to reduce the total cost of dealing with these sudden public incidents as it can. So when public emergency broke out,the emergency logistic must be established in order to supply abundant lash-up materials to resolve or deal with satisfying the essential demand of the residents, burying the death, rescuing the sound,sanitary engineering, the reestablishment after the bale, resuming production and getting back the order and so on; or else, the area of calamities and loss of live and assets would be expanded continuously. So that the establishment of emergency logistic when the emergency broke out could render the bailout materials be delivered to the spots where need them, which would have an effect upon the outcomes of the whole succor.This article studies the vehicle routing problem for emergency logistics distribution, which is based on satisfied the time limitied of emeregency materials distribution,the arrangement of vehicles’routing is more reasonable to ultimately reduce the cost of transportation,which is very meaningful for improving the efficiency of emergency logistic.
Firstly, this article proposed and analyzed the concept of emergency logistics and the characteristics,the research content and the operation flow of logistics system.Meanwhile, the article analyzed the related problems of vehicle routing problem,including the introduction,the classification,the mathematical model of typical problems and the basic solution methods. Based on the discussion of Vehicle Routing Problem (VRP) and emergency logistics,this article proposed the vehicle routing problem for emergency logistics distribution.And then,it analyzed the differences between this problem and VRP problem,and established the typical mathematical model of the VRP of unfully loaded emergency logistics distribution,simultane-ously chose Ant Colony Optimization(ACO) to solve this article solved the problem by ACO, it analyzed ACO's principle,characteristic,and established its mathematical model and then analyzed the executive steps of the algorithm's.Based on the analyses before and the defects of ACO in this article,through the inspiration of the initial solution,it updated the pheromone on the choice of strategy and pobability of transfer to mend ACO.At the end of this paper, object-oriented C++ language was applied to compile the computational procedure to improved ACO to carry the example. The result confirmed this algorithm is feasible and valid for solving this kind of problem.
引文
[1]http://politics. people.com. cn/GB/
[2]王丰,姜玉红,王进.应急物流[M].北京：中国物资出版社,2007.5
[3]OzdamarL. Emergency logistics planning in nature disasters[J].Annals of operation Research.2004,129:218-219.
[4]Rathi A.K,R.L. Church,and R.S.Solanki. "Allocating Resources to Support a Multi-commodity Flow with Time Windows." Logistics and Transportation Review 1993 vol.28,167-188.
[5]Fiedrich F, Gehbauer F, Rickers U. Optimized Resource Allocation for emergency Response after Earthquake Disasters. Safety Science.2000,30:41-57.
[6]Konstantinos G, Zografos, Konstantinos N, Androutopoulos, George M, Vasilakis. A Real-time Decision Support System for Roadway Network Response Logistics. Transportation Research Part C.2002, (10):1-18.
[7]戴更新.多资源组合应急调度问题的研究[J].系统工程理论与实践.2000,12(9)：52-55
[8]何建敏,刘春林,盛昭瀚.多出救点应急系统最优方案的选取.管理工程学
[9]计雷,池宏等.突发事件应急管理[M].北京：高等教育出版社,2005：100-101.
[10]SheuJB. An emergeney logisties distribution approach for quick response to urgent relief demand in disasters.Transportation Research PartE,2007, (43):687 - 709
[11]M.Savelsbergh.Local search for routing problem with time windows[J]. Annals of Operations Research,1985,16(4):285-305.
[12]TothP.,VigoD.Models,relaxations and exact approaches for the capacitated Vehicle Routing Problem[J]. Discrete Applied Mathematics,2002,123:487-512
[13]Belenguer, Jose M., Benavent, Enrique.A cutting Plane algorithm for the capacitated arc routing problem[J]. Computers and Operations Research,2003,5:705-728
[14]Smilowitz K.R., Atamturk A., Daganzo C. F. Deferred item and vehicle routing within integrated networks[J]. Transportation Research Part E:Logistics and Transportation Review,2003,4:305-323
[15]Secomandi, Nicola.Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands[J]. Computers and Operations Research,2000. 11-12,1201-1225.
[16]Gendreau M, Hertz A. Laporte G A tabu search heuristic for the vehicle routing problem[M]. Montrea:Publication, Centre de recherchesurles transports,1991
[17]Osman LH.Metastrategy simulated annealing and tabu search algorithm for the vehicle routing problem[J]. Operation Researeh.1993,41:421-451
[18]H.Hideki, I. Toshihide, I.Shinji, Y. Mutsunori. The vehicle routing problem with flexible time windows and traveling times[J]. Discrete Applied Mathematics,2006,154(6): 2271-2290.
[19]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.12
[20]李士勇.蚁群算法及其应用[M].哈尔滨工业大学出版社,2004.9
[21]牟欣,物流配送中的车辆路径与车辆装载整合优化问题研究[D].重庆：重庆大学硕士学位论文,2008
[22]钟石泉,物流配送车辆路径优化方法研究[D].天津：天京大学博士学位论文,2007
[23]曹二保,物流配送车辆路径问题模型及算法研究[D].长沙：湖南大学博士学位论文,2008
[24]Savelsbergh M. Local Search for Routing Problems with Time Windows[J]. Annals of Operations Research,1985,4:285-305
[25]Balakrishnan N. Simple heuristic for the vehicle routing problem with soft time windows[J]. J. Opl Res. Soc,1993(3):279-287
[26]Gambardella L.M, Taillard E, Agazzi G, MACS-VRPTVI: A Multiple Ant Colony System for Vehicle Routing Problem with Time Windows[J]. New Ideas in Optimization, 1999,63-76
[27]刘志项,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决蓑,2005,5(20)：562-566.
[28]郝会霞,基于改进蚁群算法的物流配送车辆路径优化方法的研究[D].西安：长安大学硕士学位论文,2008
[29]EquiL, GalloqMarzialeS, etal, Acombined Transportation and Seheduling Problem [J]. EuroPean Journal of Operational Research.1997,97:94-104
[30]Haffman W. Avoiding Logistics[N]. Traffic World.2005-7-4(1)
[31]Jennifer Wilsona. The Evolution of Emergency Management and Advancement towards a Profession in the United States and Florida [J]. Safety Science.2001,39:117-131
[32]PaoloToth, Daniele vigo. The Vehiele Routing Problem[M]. Soeiety for Industrial and Applied Mathematies, SIAM.2002
[33]Patriek Boisvert, Raphael Moore.Crisis and Emergeney Management-A Guide for Managers of Public Service of Canada [M]. CCMD Roundtable on Crisis Management.Canadian Centre of Management Development,Canadian 2003
[34]缪成,突发公共事件下应急物流中的优化运输问题的研究[D].上海：同济大学管理学博士学位论文,2007
[35]高慧,应急物资车辆调度模型研究[D].长沙：长沙理工大学硕士学位论文,2008
[36]黄金虎,应急物流系统若干关键技术的研究与实现[D].上海：上海交通大学硕士学位论文,2007
[37]GDantzig and J.Ramser. The truek dispatehing problem. [J]. Management Science, 6:80-91,1959.
[38]O.Braysy and M.Gendreau. Vehicle routing problem with time windows,part 1:Route construction and local search algorithms [J]. Transportation Science,39(1):104-118, 2005.
[39]J. Larsen. Parallelization of the Vehicel Routing Problem with Time Wihdows. [D]. PhD thesis, Technical University of Denmark,1999
[40]王志远,车辆优化调度及物流配送管理系统模型的研究[D].大连：大连交通大学硕士学位论文,2005
[41]陈杰,基于遗传算法的应急物资运输调度[D].哈尔滨：哈尔滨工业大学学硕士学位论文,2006
[42]龙汀,基于蚁群算法的车辆路径问题的研究[D].合肥：合肥工业大学硕士学位论文,2008
[43]周涛,基于蚁群算法的车辆优化调度系统[D].成都：电子科技大学硕士学位论文,2007
[44]朱建荣,基于蚁群算法的物流配送车辆优化调度研究[D].长沙：长沙理工大学硕士学位论文2006
[45]蒋毅,基于蚁群优化算法的车辆路径问题研究[D].吉林：吉林大学硕士学位论文,2007
[46]马良,姚俭,范炳全.蚁群算法在交通配流中的应用[J].科技通报,2003,19(5)：377-380
[47]陈幼林,王劲恺.带时间窗车辆路径问题的改进蚁群算法研究[J].计算机工程与应用,2006,29(2),218-220
[48]段海滨,王海波.一种快速全局优化的改进蚁群算法及仿真[J].信息与控制,2004,33(2)：241-244
[49]Savelsbergh M. W. P. Local search for routing problem with time windows [J]. Ant. of Operations Research,1985,4:285-305
[50]万旭,林健良,杨晓伟.改进的最大-最小蚂蚁算法在有时间窗车辆路径问题中的应用[J].计算机集成制造系统,2005,11(4),572-576
[51]李宁,皱彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践：2004(4)
[52]李继玲.蚁群算法在物流运输车辆优化调度中的应用研究[D].西安建筑科技大学硕士学位论文,2005.
[53]叶志伟, 郑肇葆.蚁群算法中参数α,β,ρ设置的研究—以TSP问题为例[J].武汉大学学报.信息科学版,2004,29(7)：597-601.
[54]詹士昌等.蚁群算法中有关算法参数的最优选择[J].科技通报,2003,19(5)：381-386.
[55]Bullnheimer B, et al. An improved ant system algorithm for the vehicle routing problem[R]. Technical report POM-10/97. Institute of Management science, University of Vienna,1997.
[56]M Dorigo, L M Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem.IEEE Trans. On EvolutionaryComputation,1997,1(1): 53-66
[57]Le Bouthillier A, Crainic T. G. A cooperative parallel metaheuristic for vehicle routing with time windows[J], Comput. Oper. Res.2005,32:1685-1708.
[58]兰世海.改进蚁群算法研究及其在车辆调度中的应用[D].东华大学硕士学位论文,2007.
[59]P. Zhao, X. Mu, J. H. Yao, Y Wang, X. T. Yang. Optimized vehicle scheduling and filling modelbased on effective space and integrated solving algorithm[J]. Journal of Chongqing University,2007,6(3):172-176
[60]A. Enrique, D. Bernabe. Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm[J]. Information Processing Letters,2006,98(3): 225-230
[61]G Barbarosoglu, Yarda. ATwo-stage Stochastic Programming Framework for Transportati on P anning in Disaster Response[J]. Journal of the Operational Research Society,2055: 43-53.1
[62]Eldessouki W M. Some development in transportation network analysis and design with application to emergency management problem[D].1998
[63]Ali haghani, Sei-chang Oh. Formulation and Solution of a Multi-commodity, Multi-modalNetwork Flow Model for Disaster Relief Operations. Transpn. Res.1996,30: 231-250.
[64]Eldessouki W M. Some development in transportation network analysis and design with application to emergency management problem[D].1998.
[65]段海滨,王海波.一种快速全局优化的改进蚁群算法及仿真[J].信息控制,2004,33(2)：241-244
[66]http://www.china-logisticsnet.com/
[2]王丰,姜玉红,王进.应急物流[M].北京：中国物资出版社,2007.5
[3]OzdamarL. Emergency logistics planning in nature disasters[J].Annals of operation Research.2004,129:218-219.
[4]Rathi A.K,R.L. Church,and R.S.Solanki. "Allocating Resources to Support a Multi-commodity Flow with Time Windows." Logistics and Transportation Review 1993 vol.28,167-188.
[5]Fiedrich F, Gehbauer F, Rickers U. Optimized Resource Allocation for emergency Response after Earthquake Disasters. Safety Science.2000,30:41-57.
[6]Konstantinos G, Zografos, Konstantinos N, Androutopoulos, George M, Vasilakis. A Real-time Decision Support System for Roadway Network Response Logistics. Transportation Research Part C.2002, (10):1-18.
[7]戴更新.多资源组合应急调度问题的研究[J].系统工程理论与实践.2000,12(9)：52-55
[8]何建敏,刘春林,盛昭瀚.多出救点应急系统最优方案的选取.管理工程学
[9]计雷,池宏等.突发事件应急管理[M].北京：高等教育出版社,2005：100-101.
[10]SheuJB. An emergeney logisties distribution approach for quick response to urgent relief demand in disasters.Transportation Research PartE,2007, (43):687 - 709
[11]M.Savelsbergh.Local search for routing problem with time windows[J]. Annals of Operations Research,1985,16(4):285-305.
[12]TothP.,VigoD.Models,relaxations and exact approaches for the capacitated Vehicle Routing Problem[J]. Discrete Applied Mathematics,2002,123:487-512
[13]Belenguer, Jose M., Benavent, Enrique.A cutting Plane algorithm for the capacitated arc routing problem[J]. Computers and Operations Research,2003,5:705-728
[14]Smilowitz K.R., Atamturk A., Daganzo C. F. Deferred item and vehicle routing within integrated networks[J]. Transportation Research Part E:Logistics and Transportation Review,2003,4:305-323
[15]Secomandi, Nicola.Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands[J]. Computers and Operations Research,2000. 11-12,1201-1225.
[16]Gendreau M, Hertz A. Laporte G A tabu search heuristic for the vehicle routing problem[M]. Montrea:Publication, Centre de recherchesurles transports,1991
[17]Osman LH.Metastrategy simulated annealing and tabu search algorithm for the vehicle routing problem[J]. Operation Researeh.1993,41:421-451
[18]H.Hideki, I. Toshihide, I.Shinji, Y. Mutsunori. The vehicle routing problem with flexible time windows and traveling times[J]. Discrete Applied Mathematics,2006,154(6): 2271-2290.
[19]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.12
[20]李士勇.蚁群算法及其应用[M].哈尔滨工业大学出版社,2004.9
[21]牟欣,物流配送中的车辆路径与车辆装载整合优化问题研究[D].重庆：重庆大学硕士学位论文,2008
[22]钟石泉,物流配送车辆路径优化方法研究[D].天津：天京大学博士学位论文,2007
[23]曹二保,物流配送车辆路径问题模型及算法研究[D].长沙：湖南大学博士学位论文,2008
[24]Savelsbergh M. Local Search for Routing Problems with Time Windows[J]. Annals of Operations Research,1985,4:285-305
[25]Balakrishnan N. Simple heuristic for the vehicle routing problem with soft time windows[J]. J. Opl Res. Soc,1993(3):279-287
[26]Gambardella L.M, Taillard E, Agazzi G, MACS-VRPTVI: A Multiple Ant Colony System for Vehicle Routing Problem with Time Windows[J]. New Ideas in Optimization, 1999,63-76
[27]刘志项,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决蓑,2005,5(20)：562-566.
[28]郝会霞,基于改进蚁群算法的物流配送车辆路径优化方法的研究[D].西安：长安大学硕士学位论文,2008
[29]EquiL, GalloqMarzialeS, etal, Acombined Transportation and Seheduling Problem [J]. EuroPean Journal of Operational Research.1997,97:94-104
[30]Haffman W. Avoiding Logistics[N]. Traffic World.2005-7-4(1)
[31]Jennifer Wilsona. The Evolution of Emergency Management and Advancement towards a Profession in the United States and Florida [J]. Safety Science.2001,39:117-131
[32]PaoloToth, Daniele vigo. The Vehiele Routing Problem[M]. Soeiety for Industrial and Applied Mathematies, SIAM.2002
[33]Patriek Boisvert, Raphael Moore.Crisis and Emergeney Management-A Guide for Managers of Public Service of Canada [M]. CCMD Roundtable on Crisis Management.Canadian Centre of Management Development,Canadian 2003
[34]缪成,突发公共事件下应急物流中的优化运输问题的研究[D].上海：同济大学管理学博士学位论文,2007
[35]高慧,应急物资车辆调度模型研究[D].长沙：长沙理工大学硕士学位论文,2008
[36]黄金虎,应急物流系统若干关键技术的研究与实现[D].上海：上海交通大学硕士学位论文,2007
[37]GDantzig and J.Ramser. The truek dispatehing problem. [J]. Management Science, 6:80-91,1959.
[38]O.Braysy and M.Gendreau. Vehicle routing problem with time windows,part 1:Route construction and local search algorithms [J]. Transportation Science,39(1):104-118, 2005.
[39]J. Larsen. Parallelization of the Vehicel Routing Problem with Time Wihdows. [D]. PhD thesis, Technical University of Denmark,1999
[40]王志远,车辆优化调度及物流配送管理系统模型的研究[D].大连：大连交通大学硕士学位论文,2005
[41]陈杰,基于遗传算法的应急物资运输调度[D].哈尔滨：哈尔滨工业大学学硕士学位论文,2006
[42]龙汀,基于蚁群算法的车辆路径问题的研究[D].合肥：合肥工业大学硕士学位论文,2008
[43]周涛,基于蚁群算法的车辆优化调度系统[D].成都：电子科技大学硕士学位论文,2007
[44]朱建荣,基于蚁群算法的物流配送车辆优化调度研究[D].长沙：长沙理工大学硕士学位论文2006
[45]蒋毅,基于蚁群优化算法的车辆路径问题研究[D].吉林：吉林大学硕士学位论文,2007
[46]马良,姚俭,范炳全.蚁群算法在交通配流中的应用[J].科技通报,2003,19(5)：377-380
[47]陈幼林,王劲恺.带时间窗车辆路径问题的改进蚁群算法研究[J].计算机工程与应用,2006,29(2),218-220
[48]段海滨,王海波.一种快速全局优化的改进蚁群算法及仿真[J].信息与控制,2004,33(2)：241-244
[49]Savelsbergh M. W. P. Local search for routing problem with time windows [J]. Ant. of Operations Research,1985,4:285-305
[50]万旭,林健良,杨晓伟.改进的最大-最小蚂蚁算法在有时间窗车辆路径问题中的应用[J].计算机集成制造系统,2005,11(4),572-576
[51]李宁,皱彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践：2004(4)
[52]李继玲.蚁群算法在物流运输车辆优化调度中的应用研究[D].西安建筑科技大学硕士学位论文,2005.
[53]叶志伟, 郑肇葆.蚁群算法中参数α,β,ρ设置的研究—以TSP问题为例[J].武汉大学学报.信息科学版,2004,29(7)：597-601.
[54]詹士昌等.蚁群算法中有关算法参数的最优选择[J].科技通报,2003,19(5)：381-386.
[55]Bullnheimer B, et al. An improved ant system algorithm for the vehicle routing problem[R]. Technical report POM-10/97. Institute of Management science, University of Vienna,1997.
[56]M Dorigo, L M Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem.IEEE Trans. On EvolutionaryComputation,1997,1(1): 53-66
[57]Le Bouthillier A, Crainic T. G. A cooperative parallel metaheuristic for vehicle routing with time windows[J], Comput. Oper. Res.2005,32:1685-1708.
[58]兰世海.改进蚁群算法研究及其在车辆调度中的应用[D].东华大学硕士学位论文,2007.
[59]P. Zhao, X. Mu, J. H. Yao, Y Wang, X. T. Yang. Optimized vehicle scheduling and filling modelbased on effective space and integrated solving algorithm[J]. Journal of Chongqing University,2007,6(3):172-176
[60]A. Enrique, D. Bernabe. Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm[J]. Information Processing Letters,2006,98(3): 225-230
[61]G Barbarosoglu, Yarda. ATwo-stage Stochastic Programming Framework for Transportati on P anning in Disaster Response[J]. Journal of the Operational Research Society,2055: 43-53.1
[62]Eldessouki W M. Some development in transportation network analysis and design with application to emergency management problem[D].1998
[63]Ali haghani, Sei-chang Oh. Formulation and Solution of a Multi-commodity, Multi-modalNetwork Flow Model for Disaster Relief Operations. Transpn. Res.1996,30: 231-250.
[64]Eldessouki W M. Some development in transportation network analysis and design with application to emergency management problem[D].1998.
[65]段海滨,王海波.一种快速全局优化的改进蚁群算法及仿真[J].信息控制,2004,33(2)：241-244
[66]http://www.china-logisticsnet.com/