Finding shortest path of the ambulance routing: Interface of A∗ algorithm using C# programming

N. A. Nordin, Zati Aqmar Zaharudin, M. A. Maasar, Norridzwan Nordin
{"title":"Finding shortest path of the ambulance routing: Interface of A∗ algorithm using C# programming","authors":"N. A. Nordin, Zati Aqmar Zaharudin, M. A. Maasar, Norridzwan Nordin","doi":"10.1109/SHUSER.2012.6268841","DOIUrl":null,"url":null,"abstract":"In order to ensure the ambulance arrival to patient is within the targeted time, ambulance availability must be ensured and the time taken to arrive can be controlled. Optimal route that able to provide shortest distance must be determined. Thus, an interface is developed to help the ambulance providers in sending the ambulance to a specified ambulance station and emergency site. The interface for the ambulance routing is designed to give shortest path and shortest distance (in km). The results obtained were programmed using C# (pronounced as C sharp) software and the A* algorithm utilized as the engine to determine the shortest distance for the ambulance in the study area.","PeriodicalId":426671,"journal":{"name":"2012 IEEE Symposium on Humanities, Science and Engineering Research","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Symposium on Humanities, Science and Engineering Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SHUSER.2012.6268841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

In order to ensure the ambulance arrival to patient is within the targeted time, ambulance availability must be ensured and the time taken to arrive can be controlled. Optimal route that able to provide shortest distance must be determined. Thus, an interface is developed to help the ambulance providers in sending the ambulance to a specified ambulance station and emergency site. The interface for the ambulance routing is designed to give shortest path and shortest distance (in km). The results obtained were programmed using C# (pronounced as C sharp) software and the A* algorithm utilized as the engine to determine the shortest distance for the ambulance in the study area.
救护车路径的最短路径寻找:用c#编程的A *算法接口
为了保证救护车在预定时间内到达病人身边,必须保证救护车的可用性,并控制救护车到达的时间。必须确定能够提供最短距离的最优路线。因此,开发了一个接口,以帮助救护提供者将救护车送到指定的救护站和紧急地点。救护车路由接口设计为最短路径和最短距离(km)。使用c#(发音为C sharp)软件对得到的结果进行编程,并利用A*算法作为引擎确定研究区域内救护车的最短距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信