洪水疏散路线优化中的交叉方法比较

M. Nur, Hazriani, N. K. Nur
{"title":"洪水疏散路线优化中的交叉方法比较","authors":"M. Nur, Hazriani, N. K. Nur","doi":"10.1109/ICAIIC57133.2023.10067101","DOIUrl":null,"url":null,"abstract":"This study aims to implement the genetic algorithm by testing the appropriate crossover methods in order to obtain optimal disaster evacuation routes based three main indicators, namely travel time, possible transportation mode, and affected road conditions. The research phase begins with establishing a flood-affected area scenario consisting of the victim's initial location, evacuation location, routing areas, affected road conditions, distance, as well as travel time. The genetic algorithm is applied by representing the genes and chromosomes based on the available data, generating the initial population and calculating the fitness value. At the stage of determining the parent in forming a new individual, roulette wheel selection is used. For the crossover method to produce new individuals, there are 3 methods tested namely single-point, two-point and uniform crossover. The new formed individuals are then mutated with a probability level of 0.1. The last stage is to form a new population by sorting individuals with the highest fitness value. These processes took place with an iteration limit of 1000. Based on the results of the implementation and tests conducted, the uniform crossover method has the most optimal results with accuracy 90% and highest fitness value of 0.896. Meanwhile, the two others methods two-point and single-point have extremely lower accuracy which are 70% and 60% respectively. This result confirmed the statement of previous research which convinced that the uniform crossover is the most effective crossover method.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Crossover Methods Comparison in Flood Evacuation Route Optimization\",\"authors\":\"M. Nur, Hazriani, N. K. Nur\",\"doi\":\"10.1109/ICAIIC57133.2023.10067101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study aims to implement the genetic algorithm by testing the appropriate crossover methods in order to obtain optimal disaster evacuation routes based three main indicators, namely travel time, possible transportation mode, and affected road conditions. The research phase begins with establishing a flood-affected area scenario consisting of the victim's initial location, evacuation location, routing areas, affected road conditions, distance, as well as travel time. The genetic algorithm is applied by representing the genes and chromosomes based on the available data, generating the initial population and calculating the fitness value. At the stage of determining the parent in forming a new individual, roulette wheel selection is used. For the crossover method to produce new individuals, there are 3 methods tested namely single-point, two-point and uniform crossover. The new formed individuals are then mutated with a probability level of 0.1. The last stage is to form a new population by sorting individuals with the highest fitness value. These processes took place with an iteration limit of 1000. Based on the results of the implementation and tests conducted, the uniform crossover method has the most optimal results with accuracy 90% and highest fitness value of 0.896. Meanwhile, the two others methods two-point and single-point have extremely lower accuracy which are 70% and 60% respectively. This result confirmed the statement of previous research which convinced that the uniform crossover is the most effective crossover method.\",\"PeriodicalId\":105769,\"journal\":{\"name\":\"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAIIC57133.2023.10067101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIIC57133.2023.10067101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究旨在基于出行时间、可能的交通方式和受影响的路况三个主要指标,通过测试合适的交叉方法来实现遗传算法,以获得最优的灾害疏散路线。研究阶段首先建立一个受洪水影响的地区情景,包括受害者的初始位置、疏散位置、路线区域、受影响的道路状况、距离以及旅行时间。采用遗传算法,根据可用数据表示基因和染色体,生成初始种群并计算适应度值。在确定形成新个体的亲本阶段,采用轮盘选择。对于交叉产生新个体的方法,测试了三种方法,即单点交叉、两点交叉和均匀交叉。新形成的个体以0.1的概率发生突变。最后一个阶段是通过对适应度值最高的个体进行分类,形成一个新的种群。这些过程以1000次的迭代限制进行。根据实施结果和测试结果,均匀交叉方法的结果最优,准确率为90%,适应度最高为0.896。另外两种方法,两点法和单点法的精度都非常低,分别为70%和60%。这一结果证实了以往研究的结论,即均匀交叉是最有效的交叉方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Crossover Methods Comparison in Flood Evacuation Route Optimization
This study aims to implement the genetic algorithm by testing the appropriate crossover methods in order to obtain optimal disaster evacuation routes based three main indicators, namely travel time, possible transportation mode, and affected road conditions. The research phase begins with establishing a flood-affected area scenario consisting of the victim's initial location, evacuation location, routing areas, affected road conditions, distance, as well as travel time. The genetic algorithm is applied by representing the genes and chromosomes based on the available data, generating the initial population and calculating the fitness value. At the stage of determining the parent in forming a new individual, roulette wheel selection is used. For the crossover method to produce new individuals, there are 3 methods tested namely single-point, two-point and uniform crossover. The new formed individuals are then mutated with a probability level of 0.1. The last stage is to form a new population by sorting individuals with the highest fitness value. These processes took place with an iteration limit of 1000. Based on the results of the implementation and tests conducted, the uniform crossover method has the most optimal results with accuracy 90% and highest fitness value of 0.896. Meanwhile, the two others methods two-point and single-point have extremely lower accuracy which are 70% and 60% respectively. This result confirmed the statement of previous research which convinced that the uniform crossover is the most effective crossover method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of AI Educational Datasets Library Using Synthetic Dataset Generation Method Channel Access Control Instead of Random Backoff Algorithm Illegal 3D Content Distribution Tracking System based on DNN Forensic Watermarking Deep Learning-based Spectral Efficiency Maximization in Massive MIMO-NOMA Systems with STAR-RIS Data Pipeline Design for Dangerous Driving Behavior Detection System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1