Genetic Algorithm-Based Strategy for Routing in Virtual Electrical Substations Aiming for Security

Camilo de Lellis Barreto Junior, Alexandre Cardoso, E. Lamounier, K. Yamanaka
{"title":"Genetic Algorithm-Based Strategy for Routing in Virtual Electrical Substations Aiming for Security","authors":"Camilo de Lellis Barreto Junior, Alexandre Cardoso, E. Lamounier, K. Yamanaka","doi":"10.1109/CLEI.2018.00032","DOIUrl":null,"url":null,"abstract":"Maintenance in electrical substation equipment involves several daily risks to the worker. When carrying out the maintenance of a large equipment, a truck is assigned to the task. It is not any place that the truck has the ability to travel, nor the workers have the free transition through the place. The objective of this work is to develop a Genetic Algorithm to solve the problem, to create a route where the level of danger is low and does not pose a risk to the health of the worker. To test the genetic algorithm, a substation virtual environment was used where the dimensions and distances are reliable for a real environment. In order to do so, the map division strategy and the creation of individuals with variable sizes were applied. The results were satisfactory, obtaining a route from the point of departure and the point of arrival.","PeriodicalId":379986,"journal":{"name":"2018 XLIV Latin American Computer Conference (CLEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 XLIV Latin American Computer Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2018.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Maintenance in electrical substation equipment involves several daily risks to the worker. When carrying out the maintenance of a large equipment, a truck is assigned to the task. It is not any place that the truck has the ability to travel, nor the workers have the free transition through the place. The objective of this work is to develop a Genetic Algorithm to solve the problem, to create a route where the level of danger is low and does not pose a risk to the health of the worker. To test the genetic algorithm, a substation virtual environment was used where the dimensions and distances are reliable for a real environment. In order to do so, the map division strategy and the creation of individuals with variable sizes were applied. The results were satisfactory, obtaining a route from the point of departure and the point of arrival.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的虚拟变电站安全布线策略
变电站设备的维护涉及到工人日常的几个风险。在进行大型设备的维修时,会派一辆卡车来执行这项任务。这不是任何地方,卡车有能力行驶,也不是工人有自由过渡通过的地方。这项工作的目标是开发一种遗传算法来解决这一问题,创建一条危险程度较低且不会对工人的健康构成风险的路线。为了测试遗传算法,使用了一个变电站虚拟环境,其尺寸和距离与真实环境相比是可靠的。为了做到这一点,应用了地图划分策略和创建不同大小的个体。结果令人满意,得到了从出发点到到达点的路线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data Quality Measurement Framework A Chatterbot Sensitive to Student's Context to Help on Software Engineering Education Quality Assessment of Awareness Support in Agile Collaborative Tools Digital Recording of Temporal Sequences of Images Applied to the Analysis of the Phenological Evolution of Maize Crops Ludic Practices to Support the Development of Software Engineering Educational Games: A Systematic Review
×
引用
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