基于a星算法的药房选址最短路径的实现

F. P. Juniawan, Dwi Yuny Sylfania, Dini Agrina
{"title":"基于a星算法的药房选址最短路径的实现","authors":"F. P. Juniawan, Dwi Yuny Sylfania, Dini Agrina","doi":"10.15575/JOIN.V4I1.296","DOIUrl":null,"url":null,"abstract":"The number of pharmacies in the Pangkalpinang City has increased rapidly. This is directly proportional to the needs of the people of Pangkalpinang City to fulfill the health needs, buy medicine or divert doctor's prescriptions. This is a debate for people who do not know the location of pharmacies in this city. Practically, people can just go to a pharmacy with a location that far from user location, even though there is a pharmacy near the user. This is because there is no pharmacy information location in the Pangkalpinang City. To solve this problem, proposed a system that can display the location of all pharmacies in the Pangkalpinang City. In addition, the system can search the shortest path from the user's location to the nearest pharmacy location around using the A * algorithm. This algorithm was chosen because its advantages that are able to produce optimal solutions according to the expected heuristic functions. The results of the testing are that the system can optimize and be able to search the shortest path from the user's location to the nearest pharmacy.","PeriodicalId":32019,"journal":{"name":"JOIN Jurnal Online Informatika","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Implementation of Finding Shortest Route for Pharmacy Location Using A-star Algorithm\",\"authors\":\"F. P. Juniawan, Dwi Yuny Sylfania, Dini Agrina\",\"doi\":\"10.15575/JOIN.V4I1.296\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The number of pharmacies in the Pangkalpinang City has increased rapidly. This is directly proportional to the needs of the people of Pangkalpinang City to fulfill the health needs, buy medicine or divert doctor's prescriptions. This is a debate for people who do not know the location of pharmacies in this city. Practically, people can just go to a pharmacy with a location that far from user location, even though there is a pharmacy near the user. This is because there is no pharmacy information location in the Pangkalpinang City. To solve this problem, proposed a system that can display the location of all pharmacies in the Pangkalpinang City. In addition, the system can search the shortest path from the user's location to the nearest pharmacy location around using the A * algorithm. This algorithm was chosen because its advantages that are able to produce optimal solutions according to the expected heuristic functions. The results of the testing are that the system can optimize and be able to search the shortest path from the user's location to the nearest pharmacy.\",\"PeriodicalId\":32019,\"journal\":{\"name\":\"JOIN Jurnal Online Informatika\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOIN Jurnal Online Informatika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15575/JOIN.V4I1.296\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOIN Jurnal Online Informatika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15575/JOIN.V4I1.296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

Pangkalpinang市的药店数量迅速增加。这与邦卡尔比南市人民满足保健需求、购买药品或转移医生处方的需求成正比。这是一场针对不知道这个城市的药店位置的人的辩论。实际上,人们可以去离用户位置很远的药店,即使用户附近有药店。这是因为在Pangkalpinang市没有药房信息位置。为了解决这一问题,提出了一个可以显示邦加尔比南市所有药店位置的系统。此外,系统还可以使用A *算法搜索从用户所在位置到附近最近的药房位置的最短路径。该算法具有根据期望的启发式函数产生最优解的优点。测试结果表明,该系统可以优化并能够搜索从用户位置到最近药房的最短路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Implementation of Finding Shortest Route for Pharmacy Location Using A-star Algorithm
The number of pharmacies in the Pangkalpinang City has increased rapidly. This is directly proportional to the needs of the people of Pangkalpinang City to fulfill the health needs, buy medicine or divert doctor's prescriptions. This is a debate for people who do not know the location of pharmacies in this city. Practically, people can just go to a pharmacy with a location that far from user location, even though there is a pharmacy near the user. This is because there is no pharmacy information location in the Pangkalpinang City. To solve this problem, proposed a system that can display the location of all pharmacies in the Pangkalpinang City. In addition, the system can search the shortest path from the user's location to the nearest pharmacy location around using the A * algorithm. This algorithm was chosen because its advantages that are able to produce optimal solutions according to the expected heuristic functions. The results of the testing are that the system can optimize and be able to search the shortest path from the user's location to the nearest pharmacy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
2
审稿时长
12 weeks
期刊最新文献
Malware Image Classification Using Deep Learning InceptionResNet-V2 and VGG-16 Method Texture Analysis of Citrus Leaf Images Using BEMD for Huanglongbing Disease Diagnosis Implementation of Ant Colony Optimization – Artificial Neural Network in Predicting the Activity of Indenopyrazole Derivative as Anti-Cancer Agent The Implementation of Restricted Boltzmann Machine in Choosing a Specialization for Informatics Students Digital Image Processing Using YCbCr Colour Space and Neuro Fuzzy to Identify Pornography
×
引用
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