Implementation of Dijkstra Algorithm with React Native to Determine Covid-19 Distribution

Since Covid-19 was declared a global pandemic because it has spread throughout the world, every effort has been made to help prevent and tackle the transmission of Covid-19, including information technology. Information technology developed to determine the shortest distance for Covid-19 cases around us needs to be developed. This research implements Dijkstra's Algorithm written in the React Native programming language to build a Covid-19 tracking application. The system can display the closest distance with a radius of at least one meter, and the test results can map the nearest radius of 41 meters and the most immediate radius of 147 meters. This system is built for the compatibility of Android OS and iOS applications with React Native programming.

The Simulation of Traffic Signal Preemption using GPS and Dijkstra Algorithm for Emergency Fire Handling at Makassar City Fire Service

The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others. The result of this research is a system that can assist firefighters when handling fire cases in terms of accelerating the firefighting team to the location of the fire. Dijkstra's algorithm will be used to find the shortest path to the fire location and the travel time. Then the traffic signal preemption simulation adjusts the color of the lights when the GPS vehicle approaches the traffic lights on the path to be traversed. The simulation results show that the use of traffic signal preemption in collaboration with Dijkstra's algorithm and GPS can help the performance of the Makassar City Fire Department, especially for handling fires that require fast time.

The Mathematical Model for searching the Shortest Route for TB Patients with the help of Dijkstra’s Algorithm

In this research paper, we have studied TB (Tuberculosis) patients who come from different traffic routes in order to seek medical help and treatment in Karachi, Sindh, Pakistan. In this research work, we have focused on the transportation problems of the TB patients. These TB patients can travel on the paths having minimum distance as found out in this paper using Dijktra’s Algorithm. People hope that they have better treatment opportunities and financial medical relief in the government and private hospitals in Karachi. There are many private hospitals in the city but unfortunately, they provide expensive treatments. As a consequence, people belonging to the poor or lower and middle classes approach government hospitals adequately. Among them, Nazimabad Chest Hospital for TB patients (under the supervision of Dow University of Health Sciences) is providing better facilities as compared to the other hospitals involved in providing medical treatments for the similar medical issues. Nazimabad Chest Hospital for TB patients is renowned for its high quality treatment of TB patients. The hospital is located inside Government Hospital Nazimabad (under the control of Dow University), Karachi. It has latest equipments, competent and qualified staff to treat TB patients. Patients have to visit the hospital on weekly basis from their homes and residences. They use several combinations of traffic routes to reach the hospital as these patients live in different areas like, Malir Cantt, Safari Park, Hassan Square, North-Nazimabad, North Karachi, Gulshan-e-Iqbal, etc. A path or road is required which takes the least amount of time and subsequently reduces the transportation charges. In this paper, an effort has been made to locate the shortest route for the convenience for these TB patients. In this paper, a mathematical model has been developed by using the method of Dijkstra’s algorithm to attain the desired objective.

Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat

The application of technology that is increasingly developing is almost felt to benefit in various aspects of life, one of which is in terms of searching for veterinary clinics. This study aims to help animal owners who have difficulty in finding clinics and shops that sell various kinds of animal needs closest to the user's location. This research uses the Scrum method, which consists of Product Backlog, Sprint Backlog, Sprint and Imcrement. The output from Dijkstra's algorithm can display the location and route of the closest veterinary clinic to application users wherever they are in an average of 4 minutes 29 seconds.

Solusi Optimal Pencarian Jalur Tercepat Menggunakan Algoritma Dijkstra Untuk Mencari Lokasi Cafe Di Bumiayu

The purpose of this study are (1) to represent the route of café location in Bumiayu in the form of graph, (2) To find a solution from the application of the Dijkstra’s algorithm to find location of café in Bumiayu, and (3) To find the recommended fastest route. The method used in this research is literature study, data collection, problem solving, and drawing conclusions. The results showed that (1) the route of café location in Bumiayu could be represented in the form of a graph, (2) the solution was found the implementation of Dijkstra’s algorithm to find the fastest route for the café location in Bumiayu, and (3) the recommended fastest route was obtained from the starting point (v32) to 14 café locations in Bumiayu (v1,v2,v3,v5,v7,v8,v9,v10,v12,v16,v19,v23,v27,v30). There are 13 café locations that match the recommended fastest route based on the calculation of Dijkstra’s algorithm. The route from starting point (v32) to due café (v9) is one example that Dijkstra’s algorithm does not always choose the smallest weight on each side but chooses the fastest route based on the total distance traveled. There is a discrepancy in the recommended fastest route from starting point (v32) to ratawit (v19). Keywords: Dijkstra, fastest route, optimal solution

Algorithm for Preventing the Spread of COVID-19 in Airports and Air Routes by Applying Fuzzy Logic and a Markov Chain

Since the start of COVID-19 and its growth into an uncontrollable pandemic, the spread of diseases through airports has become a serious health problem around the world. This study presents an algorithm to determine the risk of spread in airports and air routes. Graphs are applied to model the air transport network and Dijkstra’s algorithm is used for generating routes. Fuzzy logic is applied to evaluate multiple demographics, health, and transport variables and identify the level of spread in each airport. The algorithm applies a Markov chain to determine the probability of the arrival of an infected passenger with the COVID-19 virus to an airport in any country in the world. The results show the optimal performance of the proposed algorithm. In addition, some data are presented that allow for the application of actions in health and mobility policies to prevent the spread of infectious diseases.

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. BST has been used to store the paths that Dijkstra algorithm initialled. The proposed algorithm is aimed to control the shortest path as well as guide the driver towards the nearest vacant available space near the entrance. This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. Moreover, the reason behind using the BST is to make the generation of the path by Dijkstra’s algorithm more accurate and less time performance. The results show a range of 8.3% to 26.8% improvement in the proposed path compared to the traditional Dijkstra’s algorithm.

AN IMPROVED DIJKSTRA ALGORITHM TO FIND MINIMUM TIME PATHS FOR BUS USERS IN HANOI

In Hanoi, many roads are congested during rush hour. When going through congested roads, the movement of vehicles is very slow. As a result, traveling over a short and congested road may take more time than traveling over a longer and uncongested road. Therefore, in this paper, we study the problem of finding optimal bus routes that take less time, considering the traffic jams. We extend Dijkstra's algorithm to compute waiting time at bus stations and traveling time of buses. The experimental results show that our algorithm is suitable.

Optimization of Shortest Path Problem using Dijkstra’s Algorithm in Imprecise Environment

Dijkstra algorithm is a widely used algorithm to find the shortest path between two specified nodes in a network problem. In this paper, a generalized fuzzy Dijkstra algorithm is proposed to find the shortest path using a new parameterized defuzzification method. Here, we address most important issue like the decision maker’s choice. A numerical example is used to illustrate the efficiency of the proposed algorithm.