Finding shortest path of the ambulance routing: Interface of A algorithm using C# programming
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 provi...
| 出版年: | SHUSER 2012 - 2012 IEEE Symposium on Humanities, Science and Engineering Research |
|---|---|
| 第一著者: | |
| フォーマット: | Conference paper |
| 言語: | English |
| 出版事項: |
2012
|
| オンライン･アクセス: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867911504&doi=10.1109%2fSHUSER.2012.6268841&partnerID=40&md5=b95658f239eb94b69dbc7118e838f5de |
| 要約: | 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. © 2012 IEEE. |
|---|---|
| ISSN: | |
| DOI: | 10.1109/SHUSER.2012.6268841 |