检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吕帅 刘鹏飞 安小伟 彭钰翔 粟毅[1] LYU Shuai;LIU Pengfei;AN Xiaowei;PENG Yuxiang;SU Yi(Yunnan Earthquake Agency,Kunming 650224,China;School of Information Engineering,China University of Geosciences,Beijing 100083,China)
机构地区:[1]云南省地震局,昆明650224 [2]中国地质大学(北京)信息工程学院,北京100083
出 处:《华南地震》2023年第3期63-69,共7页South China Journal of Seismology
基 金:云南省地震局传帮带项目(CQ2-2021003)资助。
摘 要:由于地震预警台站分布较广,而地震监测中心站的运维人员较少,如何设计合理的巡检路径,以更少的巡检成本完成更多的巡检任务成为中心站面临的一个问题。文中采用高德地图API,基于遗传算法使用python编写程序实现地震预警台站巡检路径近似最优解的自动求解。通过输入云南57个地震预警基准站位置进行测试后得出,系统在样本个数为60,迭代次数为2500 h,得到近似最优路径,总行驶距离4869 km,过路费439元。相较于其他几次收敛结果,最优巡检路径收益在百公里以上,因此认为,利用遗传算法规划的台站巡检路径可以获得较低的巡检成本。Due to the wide distribution of earthquake early warning stations and the small number of operation and maintenance personnel in seismic monitoring central stations,how to design a reasonable inspection path to accomplish more inspection tasks with less inspection cost becomes a problem for central stations.Based on the Amap API and genetic algorithm,this paper uses python to write a program to realize the automatic solution of the approximate optimal solution of the inspection path of the earthquake early warning station.After testing by inputting 57 EEW benchmark station locations in Yunnan,it is concluded that the system obtains the approximate optimal path with a total driving distance of 4869 km and a toll fee of 439 yuan RMB when the number of samples is 60 and the number of iterations is 2500.Compared with other convergence results,the optimal inspection path gains more than a hundred kilometers,so the inspection cost of the station inspection path planned by using genetic algorithm is lower.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33