地震条件下城市货运枢纽规划问题研究
|
摘要
破坏性地震的发生,给城市货运枢纽带来了极大的压力。货运枢纽规模布局能否符合灾后救援物资调度运输要求,决定了灾后紧急救援工作能否顺利完成。因此在城市发展建设中,以规划年限内城市可能发生的最大等级震害为背景,考虑地震影响下货运网络与货运需求的城市货运枢纽规划是一项与城市总体规划同步,甚至要超前进行的重要工作。
货运网络上的在途可靠运输时间和救援物资需求量是地震条件下货运枢纽规划中的两个重要影响因素。本文在对货运网络抗震连通可靠度和路段修正运行速度分析基础上,对地震条件下救援物资在途可靠运输时间进行分析。本文以满足灾区人员的基本生存需求为依据,对地震条件下依赖货运枢纽的救援物资需求估算方法进行研究。在震害下人员伤亡量和避难生成量预测基础上,建立救援物资需求概念模型,并量化救援物资需求。
以救援物资储备量和需求量为依据,建立了依赖货运枢纽的救援物资调度模型,从而确定地震条件下依赖货运枢纽的救援物资流向与流量。在此基础上分别提出地震条件下的容量限制和非容量限制货运枢纽选址模型。地震条件下容量限制货运枢纽选址模型以各类物资运送时间约束下总物资可靠运输时间最小为目标函数。目标函数包含:在途可靠运输时间费用、枢纽内拥挤等待时间费用和超时惩罚费用。对比Aykin算法,本文运用的引入平衡分配的模拟退火启发式算法,降低了延时费用和总时间费用。地震条件下非容量限制货运枢纽选址模型同样以各类物资运送时间约束下总物资可靠运输时间最小为目标函数,不同之处为枢纽个数是变量,枢纽建设费用代替枢纽内等待时间费用包含在目标方程中。对比枚举算法可知,基于模拟退火的启发式算法可得到最优解。
最后以长春为例,分别进行了地震条件下救援物资需求与调运分析、容量限制和非容量限制货运枢纽选址分析,验证了本规划方法的可行性。
The destructive earthquake brings trmendous pressure to the ubran freight hubs. The scale and location of these hubs determine the effect of the mergency rescue operation. Therefore, Takes potential maximum magnitude SEISMIC in planning year for background, to meet the special traffic demand under earthquake condition is considered to be an important thing while planning urban construction activities.
The reliable transportation time in freight transport network and demend of rescue materials are two important factors of hub location under earthquake. Based on the analysis of the path connectivity reliability and correction speed under earthquake, discuss the reliable transportation time. Taking the victims’basic living requirements for basis, research the method about estimating the relief demand depending on freight hubs. Then, on the basis of predicting the population reduction and refuge generation under earthquake, designed the conceptual model of relief demand, quantify the relief demand.
Taking the reserve and demend of rescue materials for basis, establish the model of emergency logistics planning, determine the volume and direction of the rescue material flow. Then, to ensure the transportion supply goes well under earthquakes, this paper presents uncapacitated hub location model and capacitated hub location model under earthquake. The capacitated hub has been considered as an M/M/N queuing system, so, takes the cost of waiting time due to congestion besides the reliable transportation time cost and overtime surcharge in objective function. Make sure the minimum of the total supplies reliable transit time under the service time constraints of supplies as the objective function. Develop a heuristic algorithm to solve the problem. Compare with Aykin’s algorithm, the proposed algorithm decreases the total delivery time. The uncapacitated hub location model also make the minimum of total supplies reliable transit time under the service time constraints of supplies as the objective function, while the number of hubs is a decision variable and a fixed cost factor of establishing a hub which replaced the waiting time cost has been included in the objective function. Also, an heuristic algorithm to resolve the model. Compared with enumerative algorithm, presented algorithm can obtain optimum solution.
Finally, takes Chang-Chun as an example to study the demand and scheduling of relief supplies, the uncapacitated hub location and the capacitated hub location. Through the case study, validate the feasibility of the method presented in this paper.
货运网络上的在途可靠运输时间和救援物资需求量是地震条件下货运枢纽规划中的两个重要影响因素。本文在对货运网络抗震连通可靠度和路段修正运行速度分析基础上,对地震条件下救援物资在途可靠运输时间进行分析。本文以满足灾区人员的基本生存需求为依据,对地震条件下依赖货运枢纽的救援物资需求估算方法进行研究。在震害下人员伤亡量和避难生成量预测基础上,建立救援物资需求概念模型,并量化救援物资需求。
以救援物资储备量和需求量为依据,建立了依赖货运枢纽的救援物资调度模型,从而确定地震条件下依赖货运枢纽的救援物资流向与流量。在此基础上分别提出地震条件下的容量限制和非容量限制货运枢纽选址模型。地震条件下容量限制货运枢纽选址模型以各类物资运送时间约束下总物资可靠运输时间最小为目标函数。目标函数包含:在途可靠运输时间费用、枢纽内拥挤等待时间费用和超时惩罚费用。对比Aykin算法,本文运用的引入平衡分配的模拟退火启发式算法,降低了延时费用和总时间费用。地震条件下非容量限制货运枢纽选址模型同样以各类物资运送时间约束下总物资可靠运输时间最小为目标函数,不同之处为枢纽个数是变量,枢纽建设费用代替枢纽内等待时间费用包含在目标方程中。对比枚举算法可知,基于模拟退火的启发式算法可得到最优解。
最后以长春为例,分别进行了地震条件下救援物资需求与调运分析、容量限制和非容量限制货运枢纽选址分析,验证了本规划方法的可行性。
The destructive earthquake brings trmendous pressure to the ubran freight hubs. The scale and location of these hubs determine the effect of the mergency rescue operation. Therefore, Takes potential maximum magnitude SEISMIC in planning year for background, to meet the special traffic demand under earthquake condition is considered to be an important thing while planning urban construction activities.
The reliable transportation time in freight transport network and demend of rescue materials are two important factors of hub location under earthquake. Based on the analysis of the path connectivity reliability and correction speed under earthquake, discuss the reliable transportation time. Taking the victims’basic living requirements for basis, research the method about estimating the relief demand depending on freight hubs. Then, on the basis of predicting the population reduction and refuge generation under earthquake, designed the conceptual model of relief demand, quantify the relief demand.
Taking the reserve and demend of rescue materials for basis, establish the model of emergency logistics planning, determine the volume and direction of the rescue material flow. Then, to ensure the transportion supply goes well under earthquakes, this paper presents uncapacitated hub location model and capacitated hub location model under earthquake. The capacitated hub has been considered as an M/M/N queuing system, so, takes the cost of waiting time due to congestion besides the reliable transportation time cost and overtime surcharge in objective function. Make sure the minimum of the total supplies reliable transit time under the service time constraints of supplies as the objective function. Develop a heuristic algorithm to solve the problem. Compare with Aykin’s algorithm, the proposed algorithm decreases the total delivery time. The uncapacitated hub location model also make the minimum of total supplies reliable transit time under the service time constraints of supplies as the objective function, while the number of hubs is a decision variable and a fixed cost factor of establishing a hub which replaced the waiting time cost has been included in the objective function. Also, an heuristic algorithm to resolve the model. Compared with enumerative algorithm, presented algorithm can obtain optimum solution.
Finally, takes Chang-Chun as an example to study the demand and scheduling of relief supplies, the uncapacitated hub location and the capacitated hub location. Through the case study, validate the feasibility of the method presented in this paper.
引文
1 Mohammad Saadatseresht. Evacuation planning using multiobjective evolutionary optimization approach. European Journal of Operational Research. 2009, 198: 305~314
2 Alexander Stepanov. Multi-objective evacuation routing in transportation networks. European Journal of Operational Research. 2009, 198(4): 435~446
3 Naoyuki Kamiyama. An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discrete Applied Mathematics. 2009, 04
4 Elba Urbina, Brian Wolshon. National review of hurricane evacuation plans and policies: a comparison and contrast of state practices. Transportation Research Part A: Policy and Practice. 2003, 37(3): 257~275
5 Fernando Ordó?ez. A two-stage stochastic programming model for transportation network protection. Computers & Operations Research. 2009, 36(5): 1582~1590
6 Haghani A.. Formulation and solution of a multi-commodity multi-modal network flow model for disaster relief operations. Transportation Research Part A. 1996, 30: 231~250
7 Fiedrich F., Gehbauer F., Rickers U. Optimized resource allocation for emergency response after earthquake disasters. Safety Science. 2000, 35: 41~57
8 Wei Yi, Linet ?zdamar. A dynamic logistics coordination model for evacuation and support in disaster response activities. European Journal of Operational Research. 2007, 179(3): 1177~1193
9 Jean-Yves Potvin, Ying Xu, Ilham Benyahia. Vehicle routing and scheduling with dynamic travel times. Computers & Operations Research. 2006, 33(4): 1129~1137
10 Linet Ozdamar. Emergency Logistics Planning in Natural Disasters Annals of Operations Research. 2004, 129: 217~245
11 G. Derekenaris. Integrating 3G technologies for the effective management of ambulances. Computers, Environment and Urban Systems. 2001, 25(3): 267~278
12 Arun Jotshi, Qiang Gong. Dispatching and routing of emergency vehicles in disaster mitigation using data fusion. Socio-Economic Planning Sciences. 2009, 43(1): 1~24
13 Stefan P, Maria G S. A New Algorithm for Reoptimizing Paths when the Arc Costs Change. Operations Research Letters. 2003, (31): 149~160
14 S. Ichoua, M. Gendreau, J. Y. Potvin. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research. 2003, 144: 379~396
15 Wodzimiers Oryczak.On cent-dians of general networks.Location Science. 1997,5(1): 15-28
16 Vladimir Marianov, Charles Revelle. The queuing probabilistic location set covering and some extension. Socio-Economic Planning Science. 1994, 28: 167~178
17 Masood A Badri, Amr K Mortagy, Colonel Ali Alsayed. A multi-objective model for locating fire stations. European Journal of Operational Research. 1998, 110: 243~260
18 B Adenso-diaz, F Rodriguez. A simple search heuristic for the MCLP: Application to the location of the ambulance bases in a rural region. Omege. 1997, 25: 181~187
19 Timothy C. Matisziw, Alan T. Murray. Siting a facility in continuous space to maximize coverage of a region. Socio-Economic Planning Sciences. 2009, 43(2): 131~139
20 M. E. O'Kelly. Hub location with folw economies of scale. Transportation Reseach partB. 1986, 32(8): 605~616
21 M. E. O'Kelly. The Location of Interacting Hub Facilities. TRANSPORTATION SCIENCE. 1986, 20(2): 92~106
22 JOHN G. KLINCEWICZ. A dual algorithm for the uncapacitated hub location problem. Location Science. 1996, 4(3): 173~184
23 Darko Skorin-Kapov, Jadranka Skorin-Kapov, Morton O'Kelly. Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research. 1996, 94(3): 582~593
24 M. E. O'Kelly, D. Bryan. Hub network design with single and multiple allocation: A computational study. Location Science. 1997, 4(3): 125~138
25 Turgut Aykin. The hub location and routing problems. European Journal of Operational Research 83. 1995: 200~219
26 A. Ernst and M. Krishnamoorthy. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science. 1996, 4(3): 139~154
27 Jozef Kratica, Zorica Stanimirovi?. Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research. 2007, 182(1): 15~28
28 Jinhyeon Sohn, Sungsoo Park. A linear program for the two-hub location problem. European Journal of Operational Research 100. 1997: 617~622
29 Jamie Ebery, Mohan Krishnamoorthy, Andreas Ernst, Natashia Boland. The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research 120. 2000: 614~631
30 H. W. Hamacher, M. Labbe. Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics. 2004, 145(1): 104~116
31 B. Y. Kara and B. C. Tansel. On the single-assignment p-hub center problem. European Journal of Operational Research. 2000, 125(3): 648~655
32 Hatice Cal?k, Sibel A. Alumur, Bahar Y. Kara, Oya E. Karasan. A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Computers & Operations Research. 2009, 36(12): 3088~3096
33 Andreas T. Ernst, Horst Hamacher, Houyuan Jiang, Mohan Krishnamoorthy. Uncapacitated single and multiple allocation p-hub center problems. Computers & Operations Research. 2009, 36(7): 2230~2241
34袁建平.城市灾时大范围人员应急疏散探讨.自然灾害学报. 2005, 14(6): 116~119
35吴薇薇,宁宣熙.紧急疏散网络防堵塞改造研究.系统工程学报. 2006, 21(3): 244~248
36吴薇薇,宁宣熙.基于不同路径选择方案对紧急疏散网络中随机流Monte-Carlo仿真研究.山东大学学报(理工版). 2006, 20(6): 71~80
37卢兆明,林鹏,黄河潮.基于GIS的都市应急疏散系统.中国公共安全学术版. 2005, 08(2): 35~37
38缪成,许维胜,吴启迪.大规模应急救援物资运输模型的构建与求解.系统工程. 2006, 24(11): 6~12
39安李军,张建勇.紧急救灾物资物流配送系统研究.天津职业大学学报. 2006, 15(02): 37~40
40计雷.突发事件应急管理.中国科学院研究生院工程硕士教材. 2005: 100~101
41张毅,郭晓汾,王笑风.应急救援物资车辆运输线路的选择.安全与环境学报. 2006, 6(3): 51~53
42秦小虎.城市交通紧急事件处理与安全系统模型及应用研究.重庆大学博士学位论文. 2005: 36~55
43刘建,邓云峰,宋存义.基于地理信息系统(GIS)的应急调度中最佳路径的一种选择方法.中国安全科学学报. 2006, 16(4): 9~12
44刘丽霞,杨骅飞.突发事件等复杂情形下的交通路径选择问题.北京联合大学学报(自然科学版). 2004, 18(3): 67~71
45王培宏.城市交通事件应急管理系统及其理论问题的研究.天津大学硕士学位论文. 2005: 55~63
46吴艳.应急系统选址问题的优化.西安电子科技大学硕士论文. 2008
47汪定伟,张国祥.突发性灾害救援中心选址优化的模型与算法.东北大学学报(自然科学版). 2005, 26(10): 953-956
48陈志宗,尤建新重.大突发事件应急救援设施选址的多目标决策模型.管理科学. 2006, 19(4): 10-14
49姜涛,朱金福.应急设施鲁棒优化选址模型及算法.交通运输工程学报, 2007, 7(5): 101~105
50张颉,任福田,肖秋生.城市客运枢纽选址方法.北京工业大学学报. 1991, 17(4): 21~25
51袁虹,陆化普.综合交通枢纽布局规划模型与方法研究.公路交通科技. 2001, 18(3): 01~105
52晏启鹏,王忠强. AHP在公路主枢纽站场总体布局规划中的应用.西南交通大学学报. 1999, 34(2): 223~227
53刘灿齐.现代交通规划学.人民交通出版社. 2001
54郭晓汾,徐双应,闫广维.基于灰加权关联度的公路主枢纽站场布局决策方法.中国公路学报. 1997, 10(3): 83~88
55董千里.站场规划方案综合评价的AHP-F隶属度合成法.西安公路交通大学学报. 1995, 15(4): 84~89
56刘有军,晏克非.城市交通枢纽规划方案的模糊多目标决策研究.华中科技大学学报(城市科学版). 2006, 23(2): 63~66
57田园.综合交通枢纽客运站布局评价的定量优化方法研究.交通标准化. 2006 (5): 32~36
58陈秀锋,王俊波,马淋淋.公路主枢纽布局方案评价方法研究.青岛理工大学学报. 2006, 27(2): 107~110
59刘灿齐.交通枢纽选址与网络设计同时优化的模型与算法.公路交通科技. 2003, 20(3): 113~116
60陈艳艳,刘小明,梁颖.可靠度在交通系统规划与管理中的应用.人民交通出版社. 2006
61倪永军,吕高峰,黄世敏,符圣聪.基于GIS的城市道路交通系统震害预测与连通性分析.四川大学学报(工程科学版). 2007, 39: 163-167
62宋建学,李杰.震后城市交通系统连通性模拟.自然灾害学报. 1996, 5(1): 73-78
63许添本,吕奖慧.地震救灾最小风险路径选择模式之建立与应用.国立台湾大学(台大工程)学刊. 2002, 85: 33~48
64柳春光,张敬伟.交通系统地震服务性能分析.地震工程与工程振动. 2006, 26(4): 182~186
65尹之潜,李树桢.震害与地震损失的估计方法.地震工程与工程振动. 1990,10(1): 87~96
66廖旭,高常波,韩绍欣.不同时刻地震直接人员伤亡人数的预测.自然灾害学报. 1999, 04: 92-96
67陈杰.基于遗传算法的应急物资运输调度.哈尔滨工业大学硕士学位论文. 2006
68王杏.救灾物流中的物资调运模型研究.北京交通大学硕士学位论文. 2007
2 Alexander Stepanov. Multi-objective evacuation routing in transportation networks. European Journal of Operational Research. 2009, 198(4): 435~446
3 Naoyuki Kamiyama. An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discrete Applied Mathematics. 2009, 04
4 Elba Urbina, Brian Wolshon. National review of hurricane evacuation plans and policies: a comparison and contrast of state practices. Transportation Research Part A: Policy and Practice. 2003, 37(3): 257~275
5 Fernando Ordó?ez. A two-stage stochastic programming model for transportation network protection. Computers & Operations Research. 2009, 36(5): 1582~1590
6 Haghani A.. Formulation and solution of a multi-commodity multi-modal network flow model for disaster relief operations. Transportation Research Part A. 1996, 30: 231~250
7 Fiedrich F., Gehbauer F., Rickers U. Optimized resource allocation for emergency response after earthquake disasters. Safety Science. 2000, 35: 41~57
8 Wei Yi, Linet ?zdamar. A dynamic logistics coordination model for evacuation and support in disaster response activities. European Journal of Operational Research. 2007, 179(3): 1177~1193
9 Jean-Yves Potvin, Ying Xu, Ilham Benyahia. Vehicle routing and scheduling with dynamic travel times. Computers & Operations Research. 2006, 33(4): 1129~1137
10 Linet Ozdamar. Emergency Logistics Planning in Natural Disasters Annals of Operations Research. 2004, 129: 217~245
11 G. Derekenaris. Integrating 3G technologies for the effective management of ambulances. Computers, Environment and Urban Systems. 2001, 25(3): 267~278
12 Arun Jotshi, Qiang Gong. Dispatching and routing of emergency vehicles in disaster mitigation using data fusion. Socio-Economic Planning Sciences. 2009, 43(1): 1~24
13 Stefan P, Maria G S. A New Algorithm for Reoptimizing Paths when the Arc Costs Change. Operations Research Letters. 2003, (31): 149~160
14 S. Ichoua, M. Gendreau, J. Y. Potvin. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research. 2003, 144: 379~396
15 Wodzimiers Oryczak.On cent-dians of general networks.Location Science. 1997,5(1): 15-28
16 Vladimir Marianov, Charles Revelle. The queuing probabilistic location set covering and some extension. Socio-Economic Planning Science. 1994, 28: 167~178
17 Masood A Badri, Amr K Mortagy, Colonel Ali Alsayed. A multi-objective model for locating fire stations. European Journal of Operational Research. 1998, 110: 243~260
18 B Adenso-diaz, F Rodriguez. A simple search heuristic for the MCLP: Application to the location of the ambulance bases in a rural region. Omege. 1997, 25: 181~187
19 Timothy C. Matisziw, Alan T. Murray. Siting a facility in continuous space to maximize coverage of a region. Socio-Economic Planning Sciences. 2009, 43(2): 131~139
20 M. E. O'Kelly. Hub location with folw economies of scale. Transportation Reseach partB. 1986, 32(8): 605~616
21 M. E. O'Kelly. The Location of Interacting Hub Facilities. TRANSPORTATION SCIENCE. 1986, 20(2): 92~106
22 JOHN G. KLINCEWICZ. A dual algorithm for the uncapacitated hub location problem. Location Science. 1996, 4(3): 173~184
23 Darko Skorin-Kapov, Jadranka Skorin-Kapov, Morton O'Kelly. Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research. 1996, 94(3): 582~593
24 M. E. O'Kelly, D. Bryan. Hub network design with single and multiple allocation: A computational study. Location Science. 1997, 4(3): 125~138
25 Turgut Aykin. The hub location and routing problems. European Journal of Operational Research 83. 1995: 200~219
26 A. Ernst and M. Krishnamoorthy. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science. 1996, 4(3): 139~154
27 Jozef Kratica, Zorica Stanimirovi?. Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research. 2007, 182(1): 15~28
28 Jinhyeon Sohn, Sungsoo Park. A linear program for the two-hub location problem. European Journal of Operational Research 100. 1997: 617~622
29 Jamie Ebery, Mohan Krishnamoorthy, Andreas Ernst, Natashia Boland. The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research 120. 2000: 614~631
30 H. W. Hamacher, M. Labbe. Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics. 2004, 145(1): 104~116
31 B. Y. Kara and B. C. Tansel. On the single-assignment p-hub center problem. European Journal of Operational Research. 2000, 125(3): 648~655
32 Hatice Cal?k, Sibel A. Alumur, Bahar Y. Kara, Oya E. Karasan. A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Computers & Operations Research. 2009, 36(12): 3088~3096
33 Andreas T. Ernst, Horst Hamacher, Houyuan Jiang, Mohan Krishnamoorthy. Uncapacitated single and multiple allocation p-hub center problems. Computers & Operations Research. 2009, 36(7): 2230~2241
34袁建平.城市灾时大范围人员应急疏散探讨.自然灾害学报. 2005, 14(6): 116~119
35吴薇薇,宁宣熙.紧急疏散网络防堵塞改造研究.系统工程学报. 2006, 21(3): 244~248
36吴薇薇,宁宣熙.基于不同路径选择方案对紧急疏散网络中随机流Monte-Carlo仿真研究.山东大学学报(理工版). 2006, 20(6): 71~80
37卢兆明,林鹏,黄河潮.基于GIS的都市应急疏散系统.中国公共安全学术版. 2005, 08(2): 35~37
38缪成,许维胜,吴启迪.大规模应急救援物资运输模型的构建与求解.系统工程. 2006, 24(11): 6~12
39安李军,张建勇.紧急救灾物资物流配送系统研究.天津职业大学学报. 2006, 15(02): 37~40
40计雷.突发事件应急管理.中国科学院研究生院工程硕士教材. 2005: 100~101
41张毅,郭晓汾,王笑风.应急救援物资车辆运输线路的选择.安全与环境学报. 2006, 6(3): 51~53
42秦小虎.城市交通紧急事件处理与安全系统模型及应用研究.重庆大学博士学位论文. 2005: 36~55
43刘建,邓云峰,宋存义.基于地理信息系统(GIS)的应急调度中最佳路径的一种选择方法.中国安全科学学报. 2006, 16(4): 9~12
44刘丽霞,杨骅飞.突发事件等复杂情形下的交通路径选择问题.北京联合大学学报(自然科学版). 2004, 18(3): 67~71
45王培宏.城市交通事件应急管理系统及其理论问题的研究.天津大学硕士学位论文. 2005: 55~63
46吴艳.应急系统选址问题的优化.西安电子科技大学硕士论文. 2008
47汪定伟,张国祥.突发性灾害救援中心选址优化的模型与算法.东北大学学报(自然科学版). 2005, 26(10): 953-956
48陈志宗,尤建新重.大突发事件应急救援设施选址的多目标决策模型.管理科学. 2006, 19(4): 10-14
49姜涛,朱金福.应急设施鲁棒优化选址模型及算法.交通运输工程学报, 2007, 7(5): 101~105
50张颉,任福田,肖秋生.城市客运枢纽选址方法.北京工业大学学报. 1991, 17(4): 21~25
51袁虹,陆化普.综合交通枢纽布局规划模型与方法研究.公路交通科技. 2001, 18(3): 01~105
52晏启鹏,王忠强. AHP在公路主枢纽站场总体布局规划中的应用.西南交通大学学报. 1999, 34(2): 223~227
53刘灿齐.现代交通规划学.人民交通出版社. 2001
54郭晓汾,徐双应,闫广维.基于灰加权关联度的公路主枢纽站场布局决策方法.中国公路学报. 1997, 10(3): 83~88
55董千里.站场规划方案综合评价的AHP-F隶属度合成法.西安公路交通大学学报. 1995, 15(4): 84~89
56刘有军,晏克非.城市交通枢纽规划方案的模糊多目标决策研究.华中科技大学学报(城市科学版). 2006, 23(2): 63~66
57田园.综合交通枢纽客运站布局评价的定量优化方法研究.交通标准化. 2006 (5): 32~36
58陈秀锋,王俊波,马淋淋.公路主枢纽布局方案评价方法研究.青岛理工大学学报. 2006, 27(2): 107~110
59刘灿齐.交通枢纽选址与网络设计同时优化的模型与算法.公路交通科技. 2003, 20(3): 113~116
60陈艳艳,刘小明,梁颖.可靠度在交通系统规划与管理中的应用.人民交通出版社. 2006
61倪永军,吕高峰,黄世敏,符圣聪.基于GIS的城市道路交通系统震害预测与连通性分析.四川大学学报(工程科学版). 2007, 39: 163-167
62宋建学,李杰.震后城市交通系统连通性模拟.自然灾害学报. 1996, 5(1): 73-78
63许添本,吕奖慧.地震救灾最小风险路径选择模式之建立与应用.国立台湾大学(台大工程)学刊. 2002, 85: 33~48
64柳春光,张敬伟.交通系统地震服务性能分析.地震工程与工程振动. 2006, 26(4): 182~186
65尹之潜,李树桢.震害与地震损失的估计方法.地震工程与工程振动. 1990,10(1): 87~96
66廖旭,高常波,韩绍欣.不同时刻地震直接人员伤亡人数的预测.自然灾害学报. 1999, 04: 92-96
67陈杰.基于遗传算法的应急物资运输调度.哈尔滨工业大学硕士学位论文. 2006
68王杏.救灾物流中的物资调运模型研究.北京交通大学硕士学位论文. 2007