台风灾害下区域疏散公交集结点选址和车辆路径规划
|
摘要
台风是夏秋季节我国东南沿海各省频繁遭遇的主要自然灾害,造成了巨大的人员伤亡和财产损失。在台风来临之前做好应急疏散方案为应急管理者提供决策支持具有重要意义。由于中国现阶段经济和道路交通发展的国情,城市规模、人口密度远大于发达国家,家庭小汽车普及率较低,一旦发生台风灾害事件,政府需要协调组织大容量公共运输工具为主要交通方式,实施较大规模和数量的强制性人口疏散,进而高效利用城市路网通行能力完成紧急疏散。因此,本文针对台风灾害情形下,如何进行公交系统的疏散集结点的选址和疏散车辆路径规划进行研究,以期提高方案的疏散效率,最大限度的减少人员伤亡和财产损失。
为准确刻画台风灾害疏散情形,本文在系统分析了台风灾害特点、公交系统疏散管理以及需求特性的基础上,提出疏散响应时间限制的覆盖度定义及时空扩展疏散网络构造方法。通过对公交系统集结点选址决策和疏散车辆路径规划决策相关性进行分析,构建了选址-路径双层规划模型。
选址-路径双层规划模型,从疏散的快速性、全面性两个角度,为保证疏散方案的高效性提供重要的模型支持。上层决策考虑如何制定疏散公共车辆的最佳疏散路线,使受灾人群尽可能快速的到达安全区域,给定若干疏散公交集结点的位置和疏散需求,通过求解车辆路径问题(Vehicle Routing Problems, VRP),达到疏散总时间(也包括等待时间)最小;下层决策考虑如何选择最优的集结点位置和人员安排,使得尽可能多的受灾人口得以安全疏散,根据疏散小区的需求和备选的集结点情形,通过求解最大覆盖选址问题(Maximum Covering Location Problems, MCLP),使得疏散总的需求覆盖度最大。鉴于所建双层规划模型的复杂性,约束较多且具有NP-hard (Non deterministic Polynomial)问题特征,采用遗传算法进行求解,通过设计合理的染色体编码方式,经过选择、交叉、变异等过程较快速的求解得到最佳的规划策略。
Typhoon is the main natural disaster which the southeastern provinces of China often suffer in the summer and autumn seasons and that has brought great loss of property and casualties. So it is very important to prepare the emergency plan before the fall of typhoon for the emergency managers to make right decisions. Considering that China's current economic situation& road transportation development are slower, the urban size& population density are much larger than that in the developed countries and that the popularity of family cars is in the low level, the government has to, if the typhoon occurs, organize the public transportation with large capacity to perform large number and scale of obligatory population evacuation for the purpose of accomplishing the emergency evacuation by efficient use of the city's road network traffic capacity. Under the above situations, this essay analyses how to pick up the evacuation assembly stations and how to plan the evacuating route for the public vehicles under the descent of typhoon, so that the evacuation efficiency can be improved and the casualties& loss of property can also be reduced to the lowest level.
In order to depict the real evacuation situation when the typhoon occurs, the essay comes up with the definition of coverage percent of the evacuation response time and the technique of network modeling for the time-space expansion, which based on the systematic analysis of the characteristics of the typhoon and those of the evacuation management& demand of public transportation. The essay is trying to analyze the correlation between the station selection of public transportation assembly and the decision of route planning of evacuating vehicles and also build model of the bi-level planning of station selection and passing route.
As stated on the blow, the bi-level planning of stations selection& route not only guarantees the quickness of evacuating vehicles but also ensures the globality of evacuated personnel as a result that it provides the important model support for the efficient evacuation plan. In the upper level of decision, it focuses on considering establishing the optimal evacuation route for the evacuating public vehicles so that the victims are able to arrive in the safe area as soon as possible. Given the position of several evacuation assembly stations and the personnel arrangement of the evacuation community, the upper model is trying to solve the vehicle routing problem (shorted from VRP), whose objective function is the shortest time spent on evacuation (including the waiting time spent). In the lower level, it focuses on considering how to choose the optimal position of assembly stations and the personnel arrangement in order to evacuate as many victims as possible. Given the demand of the evacuation community& the alternative assembly stations, the objective function is the total coverage percent of demand met by the utmost efforts, and the question is to solve the Maximum Covering Location Problems (shorted from MCLP). Considering complexity of the bi-level programming model, there are many restrictions and it is non deterministic polynomial (shorted from NP-hard). In the situation we find the solution for model by genetic algorithm. Through the chromosome coding strategy, the best planning strategy are figured out quickly after selection, crossover and mutation process..
为准确刻画台风灾害疏散情形,本文在系统分析了台风灾害特点、公交系统疏散管理以及需求特性的基础上,提出疏散响应时间限制的覆盖度定义及时空扩展疏散网络构造方法。通过对公交系统集结点选址决策和疏散车辆路径规划决策相关性进行分析,构建了选址-路径双层规划模型。
选址-路径双层规划模型,从疏散的快速性、全面性两个角度,为保证疏散方案的高效性提供重要的模型支持。上层决策考虑如何制定疏散公共车辆的最佳疏散路线,使受灾人群尽可能快速的到达安全区域,给定若干疏散公交集结点的位置和疏散需求,通过求解车辆路径问题(Vehicle Routing Problems, VRP),达到疏散总时间(也包括等待时间)最小;下层决策考虑如何选择最优的集结点位置和人员安排,使得尽可能多的受灾人口得以安全疏散,根据疏散小区的需求和备选的集结点情形,通过求解最大覆盖选址问题(Maximum Covering Location Problems, MCLP),使得疏散总的需求覆盖度最大。鉴于所建双层规划模型的复杂性,约束较多且具有NP-hard (Non deterministic Polynomial)问题特征,采用遗传算法进行求解,通过设计合理的染色体编码方式,经过选择、交叉、变异等过程较快速的求解得到最佳的规划策略。
Typhoon is the main natural disaster which the southeastern provinces of China often suffer in the summer and autumn seasons and that has brought great loss of property and casualties. So it is very important to prepare the emergency plan before the fall of typhoon for the emergency managers to make right decisions. Considering that China's current economic situation& road transportation development are slower, the urban size& population density are much larger than that in the developed countries and that the popularity of family cars is in the low level, the government has to, if the typhoon occurs, organize the public transportation with large capacity to perform large number and scale of obligatory population evacuation for the purpose of accomplishing the emergency evacuation by efficient use of the city's road network traffic capacity. Under the above situations, this essay analyses how to pick up the evacuation assembly stations and how to plan the evacuating route for the public vehicles under the descent of typhoon, so that the evacuation efficiency can be improved and the casualties& loss of property can also be reduced to the lowest level.
In order to depict the real evacuation situation when the typhoon occurs, the essay comes up with the definition of coverage percent of the evacuation response time and the technique of network modeling for the time-space expansion, which based on the systematic analysis of the characteristics of the typhoon and those of the evacuation management& demand of public transportation. The essay is trying to analyze the correlation between the station selection of public transportation assembly and the decision of route planning of evacuating vehicles and also build model of the bi-level planning of station selection and passing route.
As stated on the blow, the bi-level planning of stations selection& route not only guarantees the quickness of evacuating vehicles but also ensures the globality of evacuated personnel as a result that it provides the important model support for the efficient evacuation plan. In the upper level of decision, it focuses on considering establishing the optimal evacuation route for the evacuating public vehicles so that the victims are able to arrive in the safe area as soon as possible. Given the position of several evacuation assembly stations and the personnel arrangement of the evacuation community, the upper model is trying to solve the vehicle routing problem (shorted from VRP), whose objective function is the shortest time spent on evacuation (including the waiting time spent). In the lower level, it focuses on considering how to choose the optimal position of assembly stations and the personnel arrangement in order to evacuate as many victims as possible. Given the demand of the evacuation community& the alternative assembly stations, the objective function is the total coverage percent of demand met by the utmost efforts, and the question is to solve the Maximum Covering Location Problems (shorted from MCLP). Considering complexity of the bi-level programming model, there are many restrictions and it is non deterministic polynomial (shorted from NP-hard). In the situation we find the solution for model by genetic algorithm. Through the chromosome coding strategy, the best planning strategy are figured out quickly after selection, crossover and mutation process..
引文
1 Elba Urbina, Brian Wolshon. National Review of Hurricane Evacuation Policies: a Comparison and Contrast of State Practices. Transportation Research Part A. 2003,11(37):257~275
2 Church R L, Cova T J. Mapping Evacuation Risk on Transportation Networks Using a Spatial Optimization Model. Transportation Research Part C, 2000, 8(1): 321~336
3 Rashid H, Haider W, Hunt L. Post Flood Assessment of Emergency Evacuation Policies in the Red River Basin. Southern Manitoba. Canadian Geographer, 2000, 44(2): 369~386
4 Knowles L. Sydney Bushfire Emergency Evacuation: Analysis of Qualitative Research Conducted with Home Owners in Bush-fire-prone-areas. California: Institute of Transport Studies Internal Publication. 2003,11(32):256~268
5 Murray, P.M., H.S. Mahmassani. Transportation Network Evacuation Planning with Household Activity Interactions. Transportation Research Record. 2004(12) :150~159
6 Murray, P.M., H.S. Mahmassani. Model of Household Trip-Chain Sequencing in Emergency Evacuation. Transportation Research Record. 2003(12):21~29
7 Chiu, Y.C., H. Zheng, J. Villalobos, B. Gautam. Modeling No-notice Mass Evacuation Using a Dynamic Traffic Flow Optimization Model. IIE Transactions, 2007(39): 83~94
8 Perkins, J.A., I.K. Dabipi, and L.D. Han. Modeling Transit Issues Unique to Hurricane Evacuations: North Carolina’s Small Urban and Rural Areas. Greensboro, NC Urban Transit Institute/Transportation Institute, NC A&T State University, 2001
9 Eldessouki W. M.. Some Developments in Transportation Network Analysis and Design with Application to Emergency Management Problems. North Carolina State University, 1998:11~18
10 Sherali Hanif D., Carter Todd B.. Location-allocation Model and Algorithm for Evacuation Planning under Hurricane/Flood Conditions. Transportation Research Part B: Methodological. 1991,25(6):439~452
11 Sirisak K,, Chao Yang. Shelter Location-Allocation Model for Flood Evacuation Planning. Journal of the Eastern Asia Society Transportation Studies. 2005(6):4237~4252
12 Yuan Fang, Han Lee D., Chin Shih-Miao, Hwang Holing. Proposed Framework for Simultaneous Optimization of Evacuation Traffic Destination and Route Assignment. Transportation Research Record. 2006(3):50~58
13 Hediye Tuydes, Athanasios Ziliaskopoulos. Network Redesign to Optimize Evacuation Contraflow. Washington DC, USA. 83th TRB Annual Meeting of 2004.
14 Post, Buckley, Schuh. Southeast United States hurricane evacuation traffic study: reverse lane standards and ITS strategies. Technical Memorandum. Final Report, Tallahassee, Florida, 2000, 20~24
15 Mitchell, S.W., Radwan, E. Heuristic Prioritization of Emergency Evacuation Staging to Reduce Clearance Time. 85th annual meeting of transportation research board. 2006, 654~657
16 McHale G.M., Collura J. Improving Emergency Vehicle Traffic Signal Priority System Assessment Methodologies. 82nd Annual Meeting of Transportation Research Board, Washington, D.C., 2003
17 Dantzig and Ramser. The Truck Dispatching Problem. Management Science. 1959(6): 80~91
18 Savelsbergh M. Local Search for Routing Problem with Time Windows. Annals of Operations Research. 1985,16(4):285~305
19 K.L. Mark, Z.G. Guo. A Genetic Algorithm for Vehicle Routing Problems with Stochastic Demand and Soft Time Windows. Systems and Information Engineering Design Symposium, Proc. of the IEEE 2004:183~190
20 Tong Zou, Ning Li, Debao Sun. Genetic Algorithm for Vehicle Routing Problem with Time Window with Uncertain Vehicle Number. Intelligent Control and Automation, WCICA 2004, Fifth World Congress, 2004:2846~2849
21 Minea Skok, Davor Skrlec, Slavko Krajcar. The Genetic Algorithm Method for Multiple Depot Capacitated Vehicle Routing Problem Solving. 4th International Conference on Knowledge-Based Intelligence Engineering System & Allied Technologies. 2004:520~526
22 Wan-rong Jih, Jane Yung-jen Hsu. Dynamic Vehicle Routing Using Hybrid Genetic Algorithm. Proc. of the 1999 IEEE International Conf. on Robotics &Automation. Detroit, Michigan,453~458
23 J. L. Bander , C.C. White. A Heuristic Search Algorithm for Path Determination with Learning. IEEE Transactions System, Humans.1998, 28(1): 131~134
24 V. Tam, L.C.Y. Tseng. Effective Heuristics to Solve Pickup and Delivery Problems with Time Windows. Tools with Artificial Intelligence, Proc. of 15th IEEE International Conference. 2003:184~188
25 GanlbardellaL.M., TaillardE., AgazzlG.. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problem with Time Windows. New Ideas in Optimization,1999.63~76
26 Baker B., A.Yeehew. A Genetic Algorithm for the Vehicle Routing Problem. Computers Operations Research. 2003,30(2):787~800
27 B.Orrlbuki, M.Nakamra, M.Osamu. A Hybrid Search Based on Genetic Algorithrms and Tabu Search for Vehicle Routing, Canada, 2002.6, the 6th International Conference on Artificial Intelligence and Soft Computing.176~181
28 K.C.Tan,Y.H.Chew,L.H.Lee. A Hybrid Multi-objective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows. Computational Optimization and Applications. 2006,34(1):115~151
29 Jie Liu. Emergency Vehicle Routing Through a Dynamically Changing Urban Area. 2009.5.Department of Electrical and Computer Engineering University of Louisville Louisville, Kentucky
30 Lam W, Xu G. Calibration of Traffic Flow Simulator for Network Reliability Assessment. Reliability of Transport Networks, Hertfordshire. 2000:139~157
31 Chen A, Reeker W. Considering Risk Taking Behavior in Travel Time Reliability. Proceedings of 80th Transportation Research Board Annual Meeting, Washington, D.C.,2000
32 Han, Yuan, Chin. Global Optimization of Emergency Evacuation Assignments. INTERFACES , 2006 , 36(6): 502~513
33 Secomandi N. Comparing Neuro-dynamic Programming Algorithms for the Vehicle Routing Problem with Stochastic Demands. Computers &Operations Research. 2000 (27):1201~1225
34 DejunH..Dynamic Routing Problems with Service Times Windows. The Hong Kong University of Science and Technology. 2000:13~16
35 Hamacher, H.W. , Tjandra, S.A. Mathematical Modeling of Evacuation problems - a state of art. Berichtedes Fraunhofer ITWM, 2001: 34~45
36 Yamada T. A Network of Approach to a City Emergency Evacuation Planning. International Journal of Systems Science,1996,27(10):931~936
37 Campos V, Da Silva P, Netto P . Evacuation Transportation Planning: a Method of Identifying Optimal Independent Routes. Proceedings of Urban Transport V: Urban Transport and the Environment for the 21st Century. Southampton : WIT Press , 2000: 555~564
38 Dunn, C. E. Newton, D. Optimal Routes in GIS and Emergency Planning Applications. Area 24: 259~267
39 Cova, T.J. and Johnson, J.P. A Network Flow Model for Lane-based Evacuation Routing. Transportation Research Part A. 2003, 37:579~604
40 Miller-Hooks, E., Patterson, S.S. On Solving Quickest Time Problems in Time-dependent, Dynamic Networks. Journal of Mathematical Modeling and Algorithms. 2004, 3(1): 39~71
41 Albert Messmer, Markos Papageorgiou. Route Diversion Control in Motorway Network via Nonlinear Optimization. IEEE Transactions on Control Systems Technology. 1995,3(1):144~154
42 Sattayhatewa, P. and Ran,B. Developing a Dynamic Traffic Management Model for Nuclear Power Plant Evacuation. 79th Annual Meeting of the Transportation Research Board, Washington, D.C., 2000, 165~169
43 Philpott Craddock. An Adaptive Discretization Algorithm for a Class of Continuous Network Programs. Networks. 2005,(26):1~11
44 Bing Mei. Development of Trip Generation Models of Hurricane Evacuation. Louisiana State University, Baton Rogue, Louisiana.2002
45 Shier DR. Optimal Locations for a Class of Nonlinear Single-facility Location Problems on a Network. Operations Research. 1983(31):292~303
46 Adel A Aly, John A White. Probabilistic Formation of the Emergency Service Location Problem. Journal of Operational Research Society. 1978(12):1167~1179
47 B. Adensodiaz, Rodriguez F. A Simple Search Heuristic for MCLP Application to the Location of the Ambulance Bases in a Rural Region. Omege. 1997(25):81~187
48 Oded Berman, Dmitry Krass. The Generalized Maximal Covering Location Problem. Computers & Operations Research, 2002,(29):563~581
49 Luis G, Acosta E, Roberto DG. Dual-based Heuristic for a Hierarchical Covering Location Problem. Computers & Operations Research,2003,(30):65~180
50 R.H.Ballou. Dynamic Warehouse Location Analysis. Journal of Marketing Research. 1968(11):271~276
51 Gunawardanee. Dynamic Versions of Set Covering Type Public Facility Location Problems. European Journal of Operation Research. 1982,10(1):190~195
52 DreznerZ. Dynamic Facility Location: The Progressive P-median Problem, Location Science.1995,3(1):1~7
53 Berman, Odoni A.R. Location Mobile Facilities on a Network with Markovian Properties.Network.1982,12:73~86
54 Wang Q, Batta R. Alrorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Severs. Annals of Operations Research. 2000,111(1):17~34
55 Serra, Marianov V. The p-median Problem in a Changing Network: The Case of Barcelona. Location Science.1998(64):363~394
56 Serra, Ratick S, Revelle C. The Maximum Capture Problem with Uncertainty. Environment and Planning.1996,23:49~59
57 Sibel Alumur, B. Y. Kara. A New Model for the Hazardous Waste Location-Routing Problem. Computers and Operations Research. 2007, 34:1406~1423
58 Yupo Chan, William B. Carter, Michael D. Burnes. A Multiple-depot, Multiple-vehicle, Location-Routing Problem with Stochastically Processed Demands. Computers and Operations Research. 2001(28):803~826
59 Dilek Tuzun, Laura I.Burke. A Two-phase Tabu Search Approach to Location Routing Problem. European Journal of Operational Research. 1999,116:87~89
60 Tai Hsi Wu, Chinyao Low. Heuristic Solutions to Multi-depot Location-Routing Problems. Computers and Operations Research. 2002(29):1393~1415
61国务院.国家突发公共事件总体应急预案. http:∥www.china.com.cn/chinese/ law/ 1086058.htm
62刘小明,胡红.应急交通疏散研究现状与展望.交通运输工程学报. 2008.6(8):109~114
63安实,王健,崔建勋.国外道路交通应急区域疏散研究综述.交通运输系统工程与信息. 2008.12.8(6):38~45
64卢兆明,林鹏,黄河潮.基于GIS的都市应急疏散系统.应急救援. 2005,8(2):34~40
65高明霞,贺国光.考虑交叉口延误和通行能力优化疏散救援路线的最小费用流模型.系统工程. 2006, 24(9):6~10
66温丽敏.重大事故应急疏散研究.沈阳东北大学,安全技术与工程博士学位报告. 2000:20~36
67蒋光胜,胡红,杨孝宽.奥运应急交通疏散预案及仿真研究.交通与物流.第六届交通运输领域国际学术会议. 2006:12~13
68宫建.奥运应急交通疏散路径选择模型研究.硕士论文.北京工业大学. 2007:15~20
69曹静.奥运应急交通疏散预案评价体系研究.硕士论文,北京工业大学. 2007:28~30
70宋瑞,何世伟,章力.紧急疏散情况下的公交车运行计划优化研究.交通运输系统工程与信息. 2009, 9(6):154~160
71谢秉磊,郭耀煌,郭强.动态车辆路径问题:现状与展望.系统工程理论方法应用. 2002,11(2):116~120
72李军,郭耀煌.物流配送车辆优化调度理论与方法.中国物资出版社. 2001
73谢秉磊.随机车辆路径问题研究.西南交通大学博士学位论文. 2003:46~86
74张建勇.模糊信息条件下车辆路径问题研究.西南交通大学博士学位论文. 2004:58~66
75林兴强,陈驰.基于行程时间可靠性的车辆优化调度.交通运输系统工程与信息, 2005,5(5):121~135
76吴憬莉,李陶深.遗传算法与禁忌搜索算法的混合策略在VRPTW问题上的应用.计算机工程与应用. 2004,18:54~57
77杨明,张立业.改进的遗传算法在有时间窗配送车辆调度中的应用.交通运输系统工程与信息. 2005,5(4):26~30
78方磊,何建敏.应急系统优化选址的模型及其算法.系统工程学. 2003(1):49~54
79陈志宗,尤建新.重大突发公共卫生事件应急救援设施选址的多目标决策模型.管理科学. 2006(4):10~14
80于洋.紧急疏散情况下车辆路径问题研究.北京交通大学硕士学位论文, 2006: 23~65
81张培红,陈宝智,卢兆明.人员应急疏散行动开始前的决策行为.东北大学学报. 2005,26(2):179~180
82 Jamei, B.,Transportation Actions to Reduce Highway Evacuation Times under Natural Disasters. Virginia Polytechnic Institute and State University. 1984.
83赖寒.地震灾害中应急医疗设施选址问题研究.西南交通大学硕士学位论. 2006: 35~39
84 F.Glover. Future Paths for Integer Programming and Links to Artificial Intelligence. Computer and Ops.Res. 1986,13(5):533~549
85 Marco, Orig OM., Gambardella L.M., Luca Maria.. Ant Colonies for the Traveling Salesman Problem. Bisosystems. 1997,43(2):73~81
86 Tang Liansheng, Cheng Wenming, Zhang Zeqiang, Lian Jian. Vehicle Routing Problem with Travel Time Reliability Constrain. International Conference on Transportation Engineering. 2007: 1831~1836
87李相勇.车辆路径问题模型及算法研究.上海交通大学博士学位论文. 2007: 66~78
88王新华.带时间窗的车辆路径问题研究.同济大学硕士学位论文. 2005: 47~53
89 Song R.. A Genetic Algorithm Based Routing Method with GPS Technology for Public Transit Vehicles. International Conference on Traffic and Transportation Studies .Beijing, China. 2000 : 831~836
90宋厚冰,蔡远利.有时间窗约束的车辆路径问题的改进遗传算法.交通与计算机. 2003,21(4): 25~27
2 Church R L, Cova T J. Mapping Evacuation Risk on Transportation Networks Using a Spatial Optimization Model. Transportation Research Part C, 2000, 8(1): 321~336
3 Rashid H, Haider W, Hunt L. Post Flood Assessment of Emergency Evacuation Policies in the Red River Basin. Southern Manitoba. Canadian Geographer, 2000, 44(2): 369~386
4 Knowles L. Sydney Bushfire Emergency Evacuation: Analysis of Qualitative Research Conducted with Home Owners in Bush-fire-prone-areas. California: Institute of Transport Studies Internal Publication. 2003,11(32):256~268
5 Murray, P.M., H.S. Mahmassani. Transportation Network Evacuation Planning with Household Activity Interactions. Transportation Research Record. 2004(12) :150~159
6 Murray, P.M., H.S. Mahmassani. Model of Household Trip-Chain Sequencing in Emergency Evacuation. Transportation Research Record. 2003(12):21~29
7 Chiu, Y.C., H. Zheng, J. Villalobos, B. Gautam. Modeling No-notice Mass Evacuation Using a Dynamic Traffic Flow Optimization Model. IIE Transactions, 2007(39): 83~94
8 Perkins, J.A., I.K. Dabipi, and L.D. Han. Modeling Transit Issues Unique to Hurricane Evacuations: North Carolina’s Small Urban and Rural Areas. Greensboro, NC Urban Transit Institute/Transportation Institute, NC A&T State University, 2001
9 Eldessouki W. M.. Some Developments in Transportation Network Analysis and Design with Application to Emergency Management Problems. North Carolina State University, 1998:11~18
10 Sherali Hanif D., Carter Todd B.. Location-allocation Model and Algorithm for Evacuation Planning under Hurricane/Flood Conditions. Transportation Research Part B: Methodological. 1991,25(6):439~452
11 Sirisak K,, Chao Yang. Shelter Location-Allocation Model for Flood Evacuation Planning. Journal of the Eastern Asia Society Transportation Studies. 2005(6):4237~4252
12 Yuan Fang, Han Lee D., Chin Shih-Miao, Hwang Holing. Proposed Framework for Simultaneous Optimization of Evacuation Traffic Destination and Route Assignment. Transportation Research Record. 2006(3):50~58
13 Hediye Tuydes, Athanasios Ziliaskopoulos. Network Redesign to Optimize Evacuation Contraflow. Washington DC, USA. 83th TRB Annual Meeting of 2004.
14 Post, Buckley, Schuh. Southeast United States hurricane evacuation traffic study: reverse lane standards and ITS strategies. Technical Memorandum. Final Report, Tallahassee, Florida, 2000, 20~24
15 Mitchell, S.W., Radwan, E. Heuristic Prioritization of Emergency Evacuation Staging to Reduce Clearance Time. 85th annual meeting of transportation research board. 2006, 654~657
16 McHale G.M., Collura J. Improving Emergency Vehicle Traffic Signal Priority System Assessment Methodologies. 82nd Annual Meeting of Transportation Research Board, Washington, D.C., 2003
17 Dantzig and Ramser. The Truck Dispatching Problem. Management Science. 1959(6): 80~91
18 Savelsbergh M. Local Search for Routing Problem with Time Windows. Annals of Operations Research. 1985,16(4):285~305
19 K.L. Mark, Z.G. Guo. A Genetic Algorithm for Vehicle Routing Problems with Stochastic Demand and Soft Time Windows. Systems and Information Engineering Design Symposium, Proc. of the IEEE 2004:183~190
20 Tong Zou, Ning Li, Debao Sun. Genetic Algorithm for Vehicle Routing Problem with Time Window with Uncertain Vehicle Number. Intelligent Control and Automation, WCICA 2004, Fifth World Congress, 2004:2846~2849
21 Minea Skok, Davor Skrlec, Slavko Krajcar. The Genetic Algorithm Method for Multiple Depot Capacitated Vehicle Routing Problem Solving. 4th International Conference on Knowledge-Based Intelligence Engineering System & Allied Technologies. 2004:520~526
22 Wan-rong Jih, Jane Yung-jen Hsu. Dynamic Vehicle Routing Using Hybrid Genetic Algorithm. Proc. of the 1999 IEEE International Conf. on Robotics &Automation. Detroit, Michigan,453~458
23 J. L. Bander , C.C. White. A Heuristic Search Algorithm for Path Determination with Learning. IEEE Transactions System, Humans.1998, 28(1): 131~134
24 V. Tam, L.C.Y. Tseng. Effective Heuristics to Solve Pickup and Delivery Problems with Time Windows. Tools with Artificial Intelligence, Proc. of 15th IEEE International Conference. 2003:184~188
25 GanlbardellaL.M., TaillardE., AgazzlG.. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problem with Time Windows. New Ideas in Optimization,1999.63~76
26 Baker B., A.Yeehew. A Genetic Algorithm for the Vehicle Routing Problem. Computers Operations Research. 2003,30(2):787~800
27 B.Orrlbuki, M.Nakamra, M.Osamu. A Hybrid Search Based on Genetic Algorithrms and Tabu Search for Vehicle Routing, Canada, 2002.6, the 6th International Conference on Artificial Intelligence and Soft Computing.176~181
28 K.C.Tan,Y.H.Chew,L.H.Lee. A Hybrid Multi-objective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows. Computational Optimization and Applications. 2006,34(1):115~151
29 Jie Liu. Emergency Vehicle Routing Through a Dynamically Changing Urban Area. 2009.5.Department of Electrical and Computer Engineering University of Louisville Louisville, Kentucky
30 Lam W, Xu G. Calibration of Traffic Flow Simulator for Network Reliability Assessment. Reliability of Transport Networks, Hertfordshire. 2000:139~157
31 Chen A, Reeker W. Considering Risk Taking Behavior in Travel Time Reliability. Proceedings of 80th Transportation Research Board Annual Meeting, Washington, D.C.,2000
32 Han, Yuan, Chin. Global Optimization of Emergency Evacuation Assignments. INTERFACES , 2006 , 36(6): 502~513
33 Secomandi N. Comparing Neuro-dynamic Programming Algorithms for the Vehicle Routing Problem with Stochastic Demands. Computers &Operations Research. 2000 (27):1201~1225
34 DejunH..Dynamic Routing Problems with Service Times Windows. The Hong Kong University of Science and Technology. 2000:13~16
35 Hamacher, H.W. , Tjandra, S.A. Mathematical Modeling of Evacuation problems - a state of art. Berichtedes Fraunhofer ITWM, 2001: 34~45
36 Yamada T. A Network of Approach to a City Emergency Evacuation Planning. International Journal of Systems Science,1996,27(10):931~936
37 Campos V, Da Silva P, Netto P . Evacuation Transportation Planning: a Method of Identifying Optimal Independent Routes. Proceedings of Urban Transport V: Urban Transport and the Environment for the 21st Century. Southampton : WIT Press , 2000: 555~564
38 Dunn, C. E. Newton, D. Optimal Routes in GIS and Emergency Planning Applications. Area 24: 259~267
39 Cova, T.J. and Johnson, J.P. A Network Flow Model for Lane-based Evacuation Routing. Transportation Research Part A. 2003, 37:579~604
40 Miller-Hooks, E., Patterson, S.S. On Solving Quickest Time Problems in Time-dependent, Dynamic Networks. Journal of Mathematical Modeling and Algorithms. 2004, 3(1): 39~71
41 Albert Messmer, Markos Papageorgiou. Route Diversion Control in Motorway Network via Nonlinear Optimization. IEEE Transactions on Control Systems Technology. 1995,3(1):144~154
42 Sattayhatewa, P. and Ran,B. Developing a Dynamic Traffic Management Model for Nuclear Power Plant Evacuation. 79th Annual Meeting of the Transportation Research Board, Washington, D.C., 2000, 165~169
43 Philpott Craddock. An Adaptive Discretization Algorithm for a Class of Continuous Network Programs. Networks. 2005,(26):1~11
44 Bing Mei. Development of Trip Generation Models of Hurricane Evacuation. Louisiana State University, Baton Rogue, Louisiana.2002
45 Shier DR. Optimal Locations for a Class of Nonlinear Single-facility Location Problems on a Network. Operations Research. 1983(31):292~303
46 Adel A Aly, John A White. Probabilistic Formation of the Emergency Service Location Problem. Journal of Operational Research Society. 1978(12):1167~1179
47 B. Adensodiaz, Rodriguez F. A Simple Search Heuristic for MCLP Application to the Location of the Ambulance Bases in a Rural Region. Omege. 1997(25):81~187
48 Oded Berman, Dmitry Krass. The Generalized Maximal Covering Location Problem. Computers & Operations Research, 2002,(29):563~581
49 Luis G, Acosta E, Roberto DG. Dual-based Heuristic for a Hierarchical Covering Location Problem. Computers & Operations Research,2003,(30):65~180
50 R.H.Ballou. Dynamic Warehouse Location Analysis. Journal of Marketing Research. 1968(11):271~276
51 Gunawardanee. Dynamic Versions of Set Covering Type Public Facility Location Problems. European Journal of Operation Research. 1982,10(1):190~195
52 DreznerZ. Dynamic Facility Location: The Progressive P-median Problem, Location Science.1995,3(1):1~7
53 Berman, Odoni A.R. Location Mobile Facilities on a Network with Markovian Properties.Network.1982,12:73~86
54 Wang Q, Batta R. Alrorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Severs. Annals of Operations Research. 2000,111(1):17~34
55 Serra, Marianov V. The p-median Problem in a Changing Network: The Case of Barcelona. Location Science.1998(64):363~394
56 Serra, Ratick S, Revelle C. The Maximum Capture Problem with Uncertainty. Environment and Planning.1996,23:49~59
57 Sibel Alumur, B. Y. Kara. A New Model for the Hazardous Waste Location-Routing Problem. Computers and Operations Research. 2007, 34:1406~1423
58 Yupo Chan, William B. Carter, Michael D. Burnes. A Multiple-depot, Multiple-vehicle, Location-Routing Problem with Stochastically Processed Demands. Computers and Operations Research. 2001(28):803~826
59 Dilek Tuzun, Laura I.Burke. A Two-phase Tabu Search Approach to Location Routing Problem. European Journal of Operational Research. 1999,116:87~89
60 Tai Hsi Wu, Chinyao Low. Heuristic Solutions to Multi-depot Location-Routing Problems. Computers and Operations Research. 2002(29):1393~1415
61国务院.国家突发公共事件总体应急预案. http:∥www.china.com.cn/chinese/ law/ 1086058.htm
62刘小明,胡红.应急交通疏散研究现状与展望.交通运输工程学报. 2008.6(8):109~114
63安实,王健,崔建勋.国外道路交通应急区域疏散研究综述.交通运输系统工程与信息. 2008.12.8(6):38~45
64卢兆明,林鹏,黄河潮.基于GIS的都市应急疏散系统.应急救援. 2005,8(2):34~40
65高明霞,贺国光.考虑交叉口延误和通行能力优化疏散救援路线的最小费用流模型.系统工程. 2006, 24(9):6~10
66温丽敏.重大事故应急疏散研究.沈阳东北大学,安全技术与工程博士学位报告. 2000:20~36
67蒋光胜,胡红,杨孝宽.奥运应急交通疏散预案及仿真研究.交通与物流.第六届交通运输领域国际学术会议. 2006:12~13
68宫建.奥运应急交通疏散路径选择模型研究.硕士论文.北京工业大学. 2007:15~20
69曹静.奥运应急交通疏散预案评价体系研究.硕士论文,北京工业大学. 2007:28~30
70宋瑞,何世伟,章力.紧急疏散情况下的公交车运行计划优化研究.交通运输系统工程与信息. 2009, 9(6):154~160
71谢秉磊,郭耀煌,郭强.动态车辆路径问题:现状与展望.系统工程理论方法应用. 2002,11(2):116~120
72李军,郭耀煌.物流配送车辆优化调度理论与方法.中国物资出版社. 2001
73谢秉磊.随机车辆路径问题研究.西南交通大学博士学位论文. 2003:46~86
74张建勇.模糊信息条件下车辆路径问题研究.西南交通大学博士学位论文. 2004:58~66
75林兴强,陈驰.基于行程时间可靠性的车辆优化调度.交通运输系统工程与信息, 2005,5(5):121~135
76吴憬莉,李陶深.遗传算法与禁忌搜索算法的混合策略在VRPTW问题上的应用.计算机工程与应用. 2004,18:54~57
77杨明,张立业.改进的遗传算法在有时间窗配送车辆调度中的应用.交通运输系统工程与信息. 2005,5(4):26~30
78方磊,何建敏.应急系统优化选址的模型及其算法.系统工程学. 2003(1):49~54
79陈志宗,尤建新.重大突发公共卫生事件应急救援设施选址的多目标决策模型.管理科学. 2006(4):10~14
80于洋.紧急疏散情况下车辆路径问题研究.北京交通大学硕士学位论文, 2006: 23~65
81张培红,陈宝智,卢兆明.人员应急疏散行动开始前的决策行为.东北大学学报. 2005,26(2):179~180
82 Jamei, B.,Transportation Actions to Reduce Highway Evacuation Times under Natural Disasters. Virginia Polytechnic Institute and State University. 1984.
83赖寒.地震灾害中应急医疗设施选址问题研究.西南交通大学硕士学位论. 2006: 35~39
84 F.Glover. Future Paths for Integer Programming and Links to Artificial Intelligence. Computer and Ops.Res. 1986,13(5):533~549
85 Marco, Orig OM., Gambardella L.M., Luca Maria.. Ant Colonies for the Traveling Salesman Problem. Bisosystems. 1997,43(2):73~81
86 Tang Liansheng, Cheng Wenming, Zhang Zeqiang, Lian Jian. Vehicle Routing Problem with Travel Time Reliability Constrain. International Conference on Transportation Engineering. 2007: 1831~1836
87李相勇.车辆路径问题模型及算法研究.上海交通大学博士学位论文. 2007: 66~78
88王新华.带时间窗的车辆路径问题研究.同济大学硕士学位论文. 2005: 47~53
89 Song R.. A Genetic Algorithm Based Routing Method with GPS Technology for Public Transit Vehicles. International Conference on Traffic and Transportation Studies .Beijing, China. 2000 : 831~836
90宋厚冰,蔡远利.有时间窗约束的车辆路径问题的改进遗传算法.交通与计算机. 2003,21(4): 25~27