DocumentCode :
2972475
Title :
Finding shortest path of the ambulance routing: Interface of A algorithm using C# programming
Author :
Nordin, Noraimi Azlin Mohd ; Zaharudin, Zati Aqmar ; Maasar, Mohd Azdi ; Nordin, Nor Amalina
Author_Institution :
Dept. of Math., Univ. Teknol. MARA (UiTM), Shah Alam, Malaysia
fYear :
2012
fDate :
24-27 June 2012
Firstpage :
1569
Lastpage :
1573
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.
Keywords :
C language; emergency services; graph theory; search problems; A* algorithm; C# programming; ambulance availability; ambulance routing; emergency site; shortest distance; shortest path algorithm; Algorithm design and analysis; Heuristic algorithms; Programming; Roads; Routing; Software; Software algorithms; A algorithm; C# interface; Haversine formula; ambulance routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Humanities, Science and Engineering Research (SHUSER), 2012 IEEE Symposium on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4673-1311-7
Type :
conf
DOI :
10.1109/SHUSER.2012.6268841
Filename :
6268841
Link To Document :
بازگشت