摘要
对历史灾害进行3维时空网络建模,通过寻找网络中的相似空间向量来挖掘灾害节点间的链式关联关系。同时通过将向量发现问题转化为一种路径优化问题来利用蚁群算法进行求解,并将蚁群算法寻找最优路径过程中的信息素参数作为算法结果进行关注,以解决仅求解最优路径所存在的路径竞争问题。MATLAB仿真结果表明该方法具有较高的精确性和实用性。
Historical disasters are modelled with threedimensional spacetime network, and the chain correlation relationship of disaster nodes are mined by seeking the similar space vector in network. At the same time, by transforming the vector discover problem into a path op timisation problem, the ant colony algorithm can be used for finding the solution, where the pheromone parameter in the process of optimal path searching of ant colony is concerned as the algorithm result so as to solve the problem of the path competition which exists when solving the optimal path only. Experimental results of MATLAB show that this method has high accuracy and practicality.
出处
《计算机应用与软件》
CSCD
北大核心
2012年第10期62-64,共3页
Computer Applications and Software
基金
国家自然科学基金项目(60903174)
中央高校基本科研业务费资助项目(HUST:2012QN087
2012QN088)
河南省重点科技攻关项目(122102310004)
郑州市创新型科技人才队伍建设工程项目(10LJRC190)
关键词
历史灾害
灾害链
蚁群算法
路径优化
信息素
Historical disaster Disaster chain Ant colony algorithm Path optimisation Pheromone
