解决疫苗冷链网络问题的人工碳纳米管合成优化

Kanon Sujaree
{"title":"解决疫苗冷链网络问题的人工碳纳米管合成优化","authors":"Kanon Sujaree","doi":"10.7763/ijmo.2020.v10.743","DOIUrl":null,"url":null,"abstract":"In this research study, a novel metaheuristic approach using nanotechnology is proposed, known as Artificial Carbon Nanotube Synthesis Optimization (ACNSO), in order to develop a vaccine cold chain network in north of Thailand. The scope of the study emphasizes Area 1 of the Office Disease Prevention and Control in the Chiang Mai region. Vaccines must be transported both to the Provincial Health Offices and hospitals in the region. This study seeks to arrange the transportation routes involved in order to achieve the shortest possible total distance. The algorithm must first of all assess the travel conditions between each point in the network, and then generate the starting solution. Efficient solutions to this problem will cut the total processing time. The study then made a comparison between the results produced by ACNSO algorithm and those of other algorithms used in earlier studies. Full factorial design was the statistical approach used to evaluate the optimal parameters for the algorithm. The experiment was designed to examine the various factors which influence the algorithm performance. The results showed that ACNSO algorithm found the best solution in experimental algorithms and 3 processing time.","PeriodicalId":134487,"journal":{"name":"International Journal of Modeling and Optimization","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Artificial Carbon Nanotube Synthesis Optimization to Address the Vaccine Cold Chain Network Problem\",\"authors\":\"Kanon Sujaree\",\"doi\":\"10.7763/ijmo.2020.v10.743\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research study, a novel metaheuristic approach using nanotechnology is proposed, known as Artificial Carbon Nanotube Synthesis Optimization (ACNSO), in order to develop a vaccine cold chain network in north of Thailand. The scope of the study emphasizes Area 1 of the Office Disease Prevention and Control in the Chiang Mai region. Vaccines must be transported both to the Provincial Health Offices and hospitals in the region. This study seeks to arrange the transportation routes involved in order to achieve the shortest possible total distance. The algorithm must first of all assess the travel conditions between each point in the network, and then generate the starting solution. Efficient solutions to this problem will cut the total processing time. The study then made a comparison between the results produced by ACNSO algorithm and those of other algorithms used in earlier studies. Full factorial design was the statistical approach used to evaluate the optimal parameters for the algorithm. The experiment was designed to examine the various factors which influence the algorithm performance. The results showed that ACNSO algorithm found the best solution in experimental algorithms and 3 processing time.\",\"PeriodicalId\":134487,\"journal\":{\"name\":\"International Journal of Modeling and Optimization\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Modeling and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7763/ijmo.2020.v10.743\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Modeling and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7763/ijmo.2020.v10.743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在这项研究中,提出了一种使用纳米技术的新型元启发式方法,称为人工碳纳米管合成优化(ACNSO),以便在泰国北部建立疫苗冷链网络。研究的范围强调清迈地区疾病预防和控制办公室的第1领域。疫苗必须运送到省卫生局和该地区的医院。本研究旨在安排运输路线,以达到尽可能短的总距离。该算法必须首先评估网络中各点之间的行驶情况,然后生成起始解。对这个问题的有效解决将缩短总处理时间。然后,研究将ACNSO算法产生的结果与早期研究中使用的其他算法的结果进行了比较。全因子设计是采用统计方法来评估算法的最佳参数。实验旨在检验影响算法性能的各种因素。结果表明,ACNSO算法在实验算法中得到了最优解,处理时间为3。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial Carbon Nanotube Synthesis Optimization to Address the Vaccine Cold Chain Network Problem
In this research study, a novel metaheuristic approach using nanotechnology is proposed, known as Artificial Carbon Nanotube Synthesis Optimization (ACNSO), in order to develop a vaccine cold chain network in north of Thailand. The scope of the study emphasizes Area 1 of the Office Disease Prevention and Control in the Chiang Mai region. Vaccines must be transported both to the Provincial Health Offices and hospitals in the region. This study seeks to arrange the transportation routes involved in order to achieve the shortest possible total distance. The algorithm must first of all assess the travel conditions between each point in the network, and then generate the starting solution. Efficient solutions to this problem will cut the total processing time. The study then made a comparison between the results produced by ACNSO algorithm and those of other algorithms used in earlier studies. Full factorial design was the statistical approach used to evaluate the optimal parameters for the algorithm. The experiment was designed to examine the various factors which influence the algorithm performance. The results showed that ACNSO algorithm found the best solution in experimental algorithms and 3 processing time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信