利用遗传算法解决了英格兰和威尔士儿童救护车的非线性位置分配问题。

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Accounts of Chemical Research Pub Date : 2021-04-18 eCollection Date: 2022-01-01 DOI:10.1080/20476965.2021.1908176
Enoch Kung, Sarah E Seaton, Padmanabhan Ramnarayan, Christina Pagel
{"title":"利用遗传算法解决了英格兰和威尔士儿童救护车的非线性位置分配问题。","authors":"Enoch Kung,&nbsp;Sarah E Seaton,&nbsp;Padmanabhan Ramnarayan,&nbsp;Christina Pagel","doi":"10.1080/20476965.2021.1908176","DOIUrl":null,"url":null,"abstract":"<p><p>Since 1997, special paediatric intensive care retrieval teams (PICRTs) based in 11 locations across England and Wales have been used to transport sick children from district general hospitals to one of 24 paediatric intensive care units. We develop a location allocation optimisation framework to help inform decisions on the optimal number of locations for each PICRT, where those locations should be, which local hospital each location serves and how many teams should station each location. Our framework allows for stochastic journey times, differential weights for each journey leg and incorporates queuing theory by considering the time spent waiting for a PICRT to become available. We examine the average waiting time and the average time to bedside under different number of operational PICRT stations, different number of teams per station and different levels of demand. We show that consolidating the teams into fewer stations for higher availability leads to better performance.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2021-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/20476965.2021.1908176","citationCount":"5","resultStr":"{\"title\":\"Using a genetic algorithm to solve a non-linear location allocation problem for specialised children's ambulances in England and Wales.\",\"authors\":\"Enoch Kung,&nbsp;Sarah E Seaton,&nbsp;Padmanabhan Ramnarayan,&nbsp;Christina Pagel\",\"doi\":\"10.1080/20476965.2021.1908176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Since 1997, special paediatric intensive care retrieval teams (PICRTs) based in 11 locations across England and Wales have been used to transport sick children from district general hospitals to one of 24 paediatric intensive care units. We develop a location allocation optimisation framework to help inform decisions on the optimal number of locations for each PICRT, where those locations should be, which local hospital each location serves and how many teams should station each location. Our framework allows for stochastic journey times, differential weights for each journey leg and incorporates queuing theory by considering the time spent waiting for a PICRT to become available. We examine the average waiting time and the average time to bedside under different number of operational PICRT stations, different number of teams per station and different levels of demand. We show that consolidating the teams into fewer stations for higher availability leads to better performance.</p>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2021-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/20476965.2021.1908176\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/20476965.2021.1908176\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2022/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/20476965.2021.1908176","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/1/1 0:00:00","PubModel":"eCollection","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 5

摘要

自1997年以来,设在英格兰和威尔士11个地点的儿科特别重症监护检索队(PICRTs)被用来将患病儿童从地区综合医院运送到24个儿科重症监护病房中的一个。我们开发了一个地点分配优化框架,以帮助决定每个PICRT的最佳地点数量,这些地点应该在哪里,每个地点为哪家当地医院服务,以及每个地点应该驻扎多少个团队。我们的框架允许随机行程时间,每个行程段的不同权重,并通过考虑等待PICRT可用的时间来结合排队理论。我们研究了在不同数量的PICRT站点、每个站点不同数量的团队和不同需求水平下的平均等待时间和平均到床边时间。我们展示了将团队整合到更少的站点以获得更高的可用性,从而获得更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Using a genetic algorithm to solve a non-linear location allocation problem for specialised children's ambulances in England and Wales.

Using a genetic algorithm to solve a non-linear location allocation problem for specialised children's ambulances in England and Wales.

Using a genetic algorithm to solve a non-linear location allocation problem for specialised children's ambulances in England and Wales.

Using a genetic algorithm to solve a non-linear location allocation problem for specialised children's ambulances in England and Wales.

Since 1997, special paediatric intensive care retrieval teams (PICRTs) based in 11 locations across England and Wales have been used to transport sick children from district general hospitals to one of 24 paediatric intensive care units. We develop a location allocation optimisation framework to help inform decisions on the optimal number of locations for each PICRT, where those locations should be, which local hospital each location serves and how many teams should station each location. Our framework allows for stochastic journey times, differential weights for each journey leg and incorporates queuing theory by considering the time spent waiting for a PICRT to become available. We examine the average waiting time and the average time to bedside under different number of operational PICRT stations, different number of teams per station and different levels of demand. We show that consolidating the teams into fewer stations for higher availability leads to better performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信