COVID-19 spread algorithm in the international airport network-DetArpds

被引:0
作者
Guevara C. [1 ,2 ]
Coronel D. [2 ]
Maldonado B.E.S. [3 ]
Flores J.E.S. [4 ]
机构
[1] DataLab, The Institute of Mathematical Sciences (ICMAT-CSIC), Madrid
[2] Centre of Mechatronics and Interactive Systems (MIST), Universidad Tecnológica Indoamérica, Pichincha, Quito
[3] Neurosurgery Department, Hospital de las Fuerzas Armadas HE-1, Pichincha, Quito
[4] Neurosurgery Department, Metropolitano Hospital, Pichincha, Quito
关键词
Airport; Algorithm; COVID-19; Network; Routes; Spread;
D O I
10.7717/PEERJ-CS.1228
中图分类号
学科分类号
摘要
Due to COVID-19, the spread of diseases through air transport has become an important issue for public health in countries globally. Moreover, mass transportation (such as air travel) was a fundamental reason why infections spread to all countries within weeks. In the last 2 years in this research area, many studies have applied machine learning methods to predict the spread of COVID-19 in different environments with optimal results. These studies have implemented algorithms, methods, techniques, and other statistical models to analyze the information in accuracy form. Accordingly, this study focuses on analyzing the spread of COVID-19 in the international airport network. Initially, we conducted a review of the technical literature on algorithms, techniques, and theorems for generating routes between two points, comprising an analysis of 80 scientific papers that were published in indexed journals between 2017 and 2021. Subsequently, we analyzed the international airport database and information on the spread of COVID-19 from 2020 to 2022 to develop an algorithm for determining airport routes and the prevention of disease spread (DetARPDS). The main objective of this computational algorithm is to generate the routes taken by people infected with COVID-19 who transited the international airport network. The DetARPDS algorithm uses graph theory to map the international airport network using geographic allocations to position each terminal (vertex), while the distance between terminals was calculated with the Euclidian distance. Additionally, the proposed algorithm employs the Dijkstra algorithm to generate route simulations from a starting point to a destination air terminal. The generated routes are then compared with chronological contagion information to determine whether they meet the temporality in the spread of the virus. Finally, the obtained results are presented achieving a high probability of 93.46% accuracy for determining the entire route of how the disease spreads. Above all, the results of the algorithm proposed improved different computational aspects, such as time processing and detection of airports with a high rate of infection concentration, in comparison with other similar studies shown in the literature review. © 2023 Guevara et al.
引用
收藏
相关论文
共 95 条
[1]  
Adacher L, Flamini M., Air robust routes: analysis of the direct costs, IFAC-PapersOnLine, 51, 7, pp. 70-75, (2018)
[2]  
Ahmad ED, Muklason A, Nurkasanah I., Route optimization of airplane travel plans using the tabu-simulated annealing algorithm to solve the traveling salesman challenge 2.0, CENIM, 2020-Proceeding: International Conference on Computer Engineering, Network, and Intelligent Multimedia 2020, pp. 217-221, (2020)
[3]  
Ahmed K, Bousson K, Coelho MF., A modified dynamic programming approach for 4D minimum fuel and emissions trajectory optimization, Aerospace, 8, 5, (2021)
[4]  
Alieksieiev V., Artificial locust swarm routing algorithm:: an approach to consider both routing via FRA and applying RAD, Proceedings of the International Conference on Information and Digital Technologies 2019, IDT 2019, pp. 1-10, (2019)
[5]  
Alrasheed M, Mohammed W, Pylyavskyy Y, Kheiri A., Local search heuristic for the optimisation of flight connections, Proceedings of the International Conference on Computer, Control, Electrical, and Electronics Engineering 2019, ICCCEEE 2019, (2019)
[6]  
(2019)
[7]  
Ayhan S, Costas P, Samet H., Prescriptive analytics system for long-range aircraft conflict detection and resolution, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems, pp. 239-248, (2018)
[8]  
Azis H, Mallongi R, Lantara D, Salim Y., Comparison of Floyd-Warshall algorithm and Greedy algorithm in determining the shortest route, Proceedings—2nd East Indonesia Conference on Computer and Information Technology: Internet of Things for Industry, EIConCIT 2018, pp. 294-298, (2018)
[9]  
Bae S, Shin HS, Lee CH, Tsourdos A., A new multiple flights routing and scheduling algorithm in terminal manoeuvring area, AIAA/IEEE Digital Avionics Systems Conference— Proceedings, 2018, (2018)
[10]  
Baeza D, Ihle CF, Ortiz JM., A comparison between ACO and Dijkstra algorithms for optimal ore concentrate pipeline routing, Journal of Cleaner Production, 144, 1 -2, pp. 149-160, (2017)