多发点情况下地震救援路径的优选算法  

Optimization algorithm of earthquake rescue routes for Multi-start conditions

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

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

出　　处：《世界地震工程》2010年第1期121-124,共4页World Earthquake Engineering

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

摘　　要：大地震后的救灾中交通运输任务十分紧急,而地震对于道路的破坏使交通网络结构发生明显变动,无法实施原有的配送计划。前人的救灾运输路径优选算法只能解决运输的单发点问题,难以满足救灾中多处救援物资及时到达和救援物资量上的需要。为此,设计的优化算法将救援的单发点扩展为多发点,将各条路段的最大运输量考虑进去同时兼顾震后道路权值的修正,以此得出的最优路径,不仅能满足运输任务的及时性,同时又能满足运输量上的需求。Transportation assignment is very urgent during the earthquake rescue after large earthquake.Roads are always destroyed by the earthquake,which can change the structure of the traffic network.Therefore,the traffic volume can＇t be fulfilled.Furthermore,previous researchers＇ algorithm on shortcut can only solve single-start issue,but can＇t solve Multi-start issue,let alone satisfying the traffic volume.So we switch the single-start issue to the Multi-start one,and take every road section＇s maximal capacity into account,which can fulfill not only the goods＇timeliness,but also the goods＇ adequacy.

关 键 词：多发点 路径优选 有效时间 最大流 抗震救灾 

分 类 号：P315.052[天文地球—地震学] U116.2[天文地球—固体地球物理学]