面向应急医疗系统快速设计的粒子群算法定制

Marek Kvet, J. Janáček
{"title":"面向应急医疗系统快速设计的粒子群算法定制","authors":"Marek Kvet, J. Janáček","doi":"10.1109/ICCC51557.2021.9454611","DOIUrl":null,"url":null,"abstract":"Mathematical modelling, and integer programming generally, has many practical applications in the field of emergency system designing. Effective and fast solving approaches for real-sized problems constitute a key stone of the decision support systems. This paper is focused only on a special class of location problems in which the exact number of facilities are to be selected in order to minimize average response time of the emergency medical system. Since the exact methods are not suitable for their unpredictable computational time, we focus on usage of a special type of a particle swarm optimization algorithm transformed to a discrete mode. We aim at the goal to confirm the hypothesis that it is possible to suggest a sophisticated heuristic for the problem, which can produce a near-to-optimal solution in much smaller time than demanded by exact methods. Especially, we concentrate our effort on customization of the algorithm by usage of uniformly deployed set as a starting swarm and on determining its most convenient size. To verify the impact of the customization, computational study with real-sized benchmarks was performed.","PeriodicalId":339049,"journal":{"name":"2021 22nd International Carpathian Control Conference (ICCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Customization of PSO Algorithm for Fast Design of Emergency Medical System\",\"authors\":\"Marek Kvet, J. Janáček\",\"doi\":\"10.1109/ICCC51557.2021.9454611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mathematical modelling, and integer programming generally, has many practical applications in the field of emergency system designing. Effective and fast solving approaches for real-sized problems constitute a key stone of the decision support systems. This paper is focused only on a special class of location problems in which the exact number of facilities are to be selected in order to minimize average response time of the emergency medical system. Since the exact methods are not suitable for their unpredictable computational time, we focus on usage of a special type of a particle swarm optimization algorithm transformed to a discrete mode. We aim at the goal to confirm the hypothesis that it is possible to suggest a sophisticated heuristic for the problem, which can produce a near-to-optimal solution in much smaller time than demanded by exact methods. Especially, we concentrate our effort on customization of the algorithm by usage of uniformly deployed set as a starting swarm and on determining its most convenient size. To verify the impact of the customization, computational study with real-sized benchmarks was performed.\",\"PeriodicalId\":339049,\"journal\":{\"name\":\"2021 22nd International Carpathian Control Conference (ICCC)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 22nd International Carpathian Control Conference (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC51557.2021.9454611\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 22nd International Carpathian Control Conference (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC51557.2021.9454611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数学建模和一般的整数规划在应急系统设计领域有许多实际应用。有效、快速地解决实际问题的方法是决策支持系统的关键。本文只关注一类特殊的选址问题,在这类选址问题中,为了最小化应急医疗系统的平均响应时间,需要选择准确的设施数量。由于精确方法不适合其不可预测的计算时间,我们着重于使用一种特殊类型的转化为离散模式的粒子群优化算法。我们的目标是确认这样一个假设,即有可能为这个问题提出一个复杂的启发式方法,它可以在比精确方法所需的更短的时间内产生接近最优的解决方案。特别是,我们集中精力通过使用统一部署的集合作为起始群来定制算法,并确定其最方便的大小。为了验证定制的影响,使用实际尺寸的基准进行了计算研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Customization of PSO Algorithm for Fast Design of Emergency Medical System
Mathematical modelling, and integer programming generally, has many practical applications in the field of emergency system designing. Effective and fast solving approaches for real-sized problems constitute a key stone of the decision support systems. This paper is focused only on a special class of location problems in which the exact number of facilities are to be selected in order to minimize average response time of the emergency medical system. Since the exact methods are not suitable for their unpredictable computational time, we focus on usage of a special type of a particle swarm optimization algorithm transformed to a discrete mode. We aim at the goal to confirm the hypothesis that it is possible to suggest a sophisticated heuristic for the problem, which can produce a near-to-optimal solution in much smaller time than demanded by exact methods. Especially, we concentrate our effort on customization of the algorithm by usage of uniformly deployed set as a starting swarm and on determining its most convenient size. To verify the impact of the customization, computational study with real-sized benchmarks was performed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信