基于图层拼接的震后多发点救灾路线优化算法  

Map layer splicing-based optimization algorithm for post-earthquake multi-starting spot disaster relief routes

作　　者：王艳萍[1] 刘文堂[1] 牛永君[1] 黄猛[1] 赵晓燕[1] 赵永安[1] 

机构地区：[1]防灾科技学院,河北三河065201

出　　处：《自然灾害学报》2010年第3期62-66,共5页Journal of Natural Disasters

基　　金：地震科学联合基金资助课题项目(C08080)

摘　　要：提出了一种在尽量挖掘震后实际交通网络潜力的基础上,建立包括空运、水运、铁路运输和各等级公路的公路运输在内的图层拼接震后交通图的新方法。在构造震后交通图的过程中,搜索能为灾区提供某类救援物资(救援队伍)的诸多地点。提出了一种多发点情况下地震救灾路径的优化算法——逐次逼近法。The paper presents a new method of tapping the potential of actual post-earthquake traffic network as possible,and establishing the layer splicing based post-earthquake traffic map which includes air transport,water transport,rail transport,road transport comprising different grades of highway.In constructing post-earthquake traffic map,a lot of location was searched for supply of some kinds of disaster relief goods and materials and at the same time,a multi-point earthquake relief routes optimization algorithm ─ successive approximation method was presented.

关 键 词：地震 救灾 多发点 优化算法 

分 类 号：P315.9[天文地球—地震学]