A modified micro-genetic algorithm for robust emergency system designing

S. Pesko, Zuzana Borčinová
{"title":"A modified micro-genetic algorithm for robust emergency system designing","authors":"S. Pesko, Zuzana Borčinová","doi":"10.1109/CarpathianCC.2019.8765916","DOIUrl":null,"url":null,"abstract":"We study a robust emergency system in a transport network where it is necessary to solve a problem of finding p service centers for randomly emergency demands in nodes. The objective of our problem is to minimize the upper bound of partial object functions for given number of detrimental scenarios. Transport network is modelled in a matrix form i.e elements of the matrix are response times from a potential service center to a location of an user. Such matrix is given for every detrimental scenario. At last every location is given a number of shared users. We present modified micro-genetic algorithm on the instance of transport network of Slovak Republic. We verify it in selected regions of network via comparing it to known exact solutions. We also seek an approximate solution for a total network.","PeriodicalId":122628,"journal":{"name":"2019 20th International Carpathian Control Conference (ICCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th International Carpathian Control Conference (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CarpathianCC.2019.8765916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study a robust emergency system in a transport network where it is necessary to solve a problem of finding p service centers for randomly emergency demands in nodes. The objective of our problem is to minimize the upper bound of partial object functions for given number of detrimental scenarios. Transport network is modelled in a matrix form i.e elements of the matrix are response times from a potential service center to a location of an user. Such matrix is given for every detrimental scenario. At last every location is given a number of shared users. We present modified micro-genetic algorithm on the instance of transport network of Slovak Republic. We verify it in selected regions of network via comparing it to known exact solutions. We also seek an approximate solution for a total network.
鲁棒应急系统设计中的改进微遗传算法
研究了运输网络中的鲁棒应急系统,该系统需要解决节点随机应急需求寻找p个服务中心的问题。我们问题的目标是在给定数量的不利情况下最小化部分目标函数的上界。传输网络以矩阵形式建模,即矩阵的元素是从潜在服务中心到用户位置的响应时间。对于每一种不利情形,都给出了这样的矩阵。最后,每个位置都有一些共享用户。以斯洛伐克运输网为例,提出了改进的微遗传算法。我们通过将其与已知的精确解进行比较,在网络的选定区域进行验证。我们还寻求了一个全网的近似解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书