群体处理或测试事件中临时设施位置和排队问题的模拟启发式和学习启发式算法

IF 1.3 4区 工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Simulation Pub Date : 2023-01-24 DOI:10.1080/17477778.2023.2166879
C. Bayliss, Javier Panadero
{"title":"群体处理或测试事件中临时设施位置和排队问题的模拟启发式和学习启发式算法","authors":"C. Bayliss, Javier Panadero","doi":"10.1080/17477778.2023.2166879","DOIUrl":null,"url":null,"abstract":"Epidemic outbreaks, such as the one generated by the coronavirus disease, have raised the need for more efficient healthcare logistics. One of the challenges that many governments have to face in such scenarios is the deployment of temporary medical facilities across a region with the purpose of providing medical services to their citizens. This work tackles this temporary-facility location and queuing problem with the goals of minimising costs, the expected completion time, population travel time, and waiting time. The completion time for a facility depends on the numbers assigned to those facilities as well as stochastic arrival times. This work proposes a learnheuristic algorithm to solve the facility location and population assignment problem. Firstly a machine learning algorithm is trained using data from a queuing model (simulation module). The learnheuristic then constructs solutions using the machine learning algorithm to rapidly evaluate decisions in terms of facility completion and population waiting times. The efficiency and quality of the algorithm is demonstrated by comparison with exact and simulation-only (simheuristic) methodologies. A series of experiments are performed which explore the trade-offs between solution cost, completion time, population travel time, and waiting time. © 2023 The Operational Research Society.","PeriodicalId":51296,"journal":{"name":"Journal of Simulation","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Simheuristic and learnheuristic algorithms for the temporary-facility location and queuing problem during population treatment or testing events\",\"authors\":\"C. Bayliss, Javier Panadero\",\"doi\":\"10.1080/17477778.2023.2166879\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Epidemic outbreaks, such as the one generated by the coronavirus disease, have raised the need for more efficient healthcare logistics. One of the challenges that many governments have to face in such scenarios is the deployment of temporary medical facilities across a region with the purpose of providing medical services to their citizens. This work tackles this temporary-facility location and queuing problem with the goals of minimising costs, the expected completion time, population travel time, and waiting time. The completion time for a facility depends on the numbers assigned to those facilities as well as stochastic arrival times. This work proposes a learnheuristic algorithm to solve the facility location and population assignment problem. Firstly a machine learning algorithm is trained using data from a queuing model (simulation module). The learnheuristic then constructs solutions using the machine learning algorithm to rapidly evaluate decisions in terms of facility completion and population waiting times. The efficiency and quality of the algorithm is demonstrated by comparison with exact and simulation-only (simheuristic) methodologies. A series of experiments are performed which explore the trade-offs between solution cost, completion time, population travel time, and waiting time. © 2023 The Operational Research Society.\",\"PeriodicalId\":51296,\"journal\":{\"name\":\"Journal of Simulation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2023-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Simulation\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/17477778.2023.2166879\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Simulation","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/17477778.2023.2166879","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

摘要

疫情爆发,如冠状病毒疾病引发的疫情,提高了对更高效医疗物流的需求。在这种情况下,许多政府必须面临的挑战之一是在整个地区部署临时医疗设施,为其公民提供医疗服务。这项工作解决了这个临时设施的位置和排队问题,目的是最大限度地减少成本、预期完工时间、人口出行时间和等待时间。设施的完工时间取决于分配给这些设施的数字以及随机到达时间。本文提出了一种学习启发式算法来解决设施选址和人口分配问题。首先,使用来自排队模型(模拟模块)的数据来训练机器学习算法。然后,学习启发式使用机器学习算法构建解决方案,以根据设施完成情况和人口等待时间快速评估决策。通过与精确和仅模拟(simheuristic)方法的比较,证明了该算法的效率和质量。进行了一系列实验,探讨了解决方案成本、完成时间、人口旅行时间和等待时间之间的权衡。©2023运营研究学会。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Simheuristic and learnheuristic algorithms for the temporary-facility location and queuing problem during population treatment or testing events
Epidemic outbreaks, such as the one generated by the coronavirus disease, have raised the need for more efficient healthcare logistics. One of the challenges that many governments have to face in such scenarios is the deployment of temporary medical facilities across a region with the purpose of providing medical services to their citizens. This work tackles this temporary-facility location and queuing problem with the goals of minimising costs, the expected completion time, population travel time, and waiting time. The completion time for a facility depends on the numbers assigned to those facilities as well as stochastic arrival times. This work proposes a learnheuristic algorithm to solve the facility location and population assignment problem. Firstly a machine learning algorithm is trained using data from a queuing model (simulation module). The learnheuristic then constructs solutions using the machine learning algorithm to rapidly evaluate decisions in terms of facility completion and population waiting times. The efficiency and quality of the algorithm is demonstrated by comparison with exact and simulation-only (simheuristic) methodologies. A series of experiments are performed which explore the trade-offs between solution cost, completion time, population travel time, and waiting time. © 2023 The Operational Research Society.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Simulation
Journal of Simulation COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-OPERATIONS RESEARCH & MANAGEMENT SCIENCE
CiteScore
5.70
自引率
16.00%
发文量
42
期刊介绍: Journal of Simulation (JOS) aims to publish both articles and technical notes from researchers and practitioners active in the field of simulation. In JOS, the field of simulation includes the techniques, tools, methods and technologies of the application and the use of discrete-event simulation, agent-based modelling and system dynamics.
期刊最新文献
Live fitting of process data within digital twins of manufacturing to use simulation and optimisation Mitigating housing market shocks: an agent-based reinforcement learning approach with implications for real-time decision support Hybrid simulation in healthcare: a systematic exploration of models, applications, and emerging trends Increasing the performance of a hospital department with budget allocation model and machine learning assisted by simulation Towards sharing tools and artefacts for reusable simulations in healthcare
×
引用
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