1642-2511 Comparative analysis of algorithms for calculating arrival times of emergency vehicles Analiza porównawcza algorytmów wyznaczania czasów dojazdów pojazdów ratunkowych Płokita Izabela author Piórkowski Adam author Lupa Michał author AGH University of Science and Technology, Faculty of Geology, Geophysics and Environmental Protection, Department of Geoinformatics and Applied Computer Science Department of Geoinformatics and Remote Sensing, Faculty of Geography and Regional Studies, University of Warsaw; College of Inter-Faculty Individual Studies in Mathematics and Natural Sciences Correspondence to: Izabela Płokita iplokita@agh.edu.pl Correspondence to: Adam Piórkowski pioro@agh.edu.pl Correspondence to: Michał Lupa mlupa@agh.edu.pl 16 11 2016 Vol. 15 (2016) 2016 85 91 Copyright © 2016 2016 <p>The problem discussed in this article covers the issue of the generation and computational complexity of an arrival time map of emergency vehicles (ambulances). Finding the optimal (fastest) route between two points is a complex and time-consuming task. Moreover, the discussed issues are identical to the problems faced by dispatchers from Malopolska Medical Emergency. Therefore, the aim was to develop algorithms to reduce time calculations, based on the reduction of their number only to the points where ambulances are able to reach within the specifi ed time. There were compared three types of algorithms, taking into account their time and computational complexity. The result of the research was to identify algorithms, which depending on the adopted criteria allow to achieve optimal results.</p> 1 Aho A., Hopcroft J., Ullman J.: Algorytmy i struktury danych, Helion, 2003, pp. 217–229 2 Bell, M. and Iida, Y. (1997) Transportation Network Analysis John Wiley, Chichester 3 Bellman R.: On a routing problem, Quarterly of Applied Mathematics, nr 16, 1958, pp. 87–90 4 Bernas M., Wiśniewska J.: Quantum road traffic model for ambulance travel time estimation. Journal of Medical Informatics &amp; Technologies, Vol. 22, 2013, pp. 257–264 5 Bielecka E., Filipczak A., 2010: Zasady opracowywania map dostępności. Roczniki Geomatyki 2010, t. 8, z. 6: 29–38, PTIP, Warszawa 6 Cichociński P., Dębińska E.: Badanie Dostępności Komunikacyjnej Wybranej Lokalizacji z Wykorzystaniem Funkcji Analiz Sieciowych. Roczniki Geomatyki 2012, t. 10, z. 6(54), PTIP, Warszawa 7 Curtin M. K.: Network Analysis in Geographic Information Science: Review, Assessment, and Projection. Cartography and Geographic Information Science 34(2):103–111, April 2007 8 Dijkstra E. W.: A note on two problems in connexion with graphs, Numerische Mathematik, nr 1, 1959, pp. 269–271 9 Diller G.P., Kempny A., Piorkowski A., Grubler M., Swan L., Baumgartner H., Dimopoulos K., Gatzoulis M.A.: Choice and competition between adult congenital heart disease centers: evidence of considerable geographical disparities and association with clinical or academic results. Circulation: Cardiovascular Quality and Outcomes, Vol. 7(2), 2014, pp. 285–291 10 Fischer M. M.: GIS and Network Analysis. Handbook of Transport Geography and Spatial Systems, Publisher: Elsevier, Editors: Hensher D, Button K, Haynes K, Stopher P, pp. 391–408 11 Hart P. E., Nilsson N. J., Raphael B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, nr 4, 1986, pp. 100–107 12 Robusto C.: The Cosine-Haversine Formula, The American Mathematical Monthly, 1957, pp. 38–40 13 Kozieł G.: Algorytmy wyznaczanie optymalnej trasy przejazdu, Logistyka, nr 3, 2014, pp. 3206–3212 14 Łukasik P., Piórkowski A.: Opracowanie Charakterystyk Prędkości Karetek Na Podstawie Danych Rzeczywistych. Studia Informatica, vol. 37, number 1 (123), 2016 15 Mwemezi J., Huang Y.: Optimal Facility Location on Spherical Surfaces: Algorithm and Application, New York Science Journal, nr 4, 2011, pp. 21–28 16 Simić D., Simić S.: Hybrid Artificial Intelligence Approaches on Vehicle Routing Problem in Logistics Distribution. Hybrid Artifi cial Intelligent Systems Volume 7208 of the series Lecture Notes in Computer Science pp. 208–220