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

2021 ◽  
Vol 3 (2) ◽  
pp. 185-202
Author(s):  
Melki Friaswanto ◽  
◽  
Erick Alfons Lisangan ◽  
Sean Coonery Sumarta
Keyword(s):  
Fire Department ◽  
Fire Service ◽  
Traffic Signal ◽  
Fast Time ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Traffic Lights ◽  
Dijkstra's Algorithm ◽  
Simulation Results ◽  
Fire Location

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.

scholarly journals Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra

2020 ◽  
Vol 164 ◽  
pp. 10016
Author(s):  
Mikhail Urubkin ◽  
Vasiliy Galushka ◽  
Vladimir Fathi ◽  
Denis Fathi ◽  
Sofya Petrenkova
Keyword(s):  
Relational Algebra ◽  
Management Systems ◽  
Dijkstra’S Algorithm ◽  
Topical Issue ◽  
Dijkstra Algorithm ◽  
System Architectures ◽  
Dijkstra's Algorithm ◽  
Path Search ◽  
Sql Language ◽  
The Impact

The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of the Transact-SQL language. The efficiency of the known information system architectures and the impact of various ways of distributing functions between system components are reviewed. The article describes features of the relational algebra and the Transact-SQL operations, and provides a brief description of Dijkstra’s algorithm. For its programmatic implementation, several stages are defined, for each of which a formal description of the relational operations performed on it is given. The outputs of these operations are shown using the example of the database tables, and the algorithm to find the final path is given. The issues of the proposed method’s productivity and security of programmatic implementation of the path search in a graph are discussed separately.

scholarly journals The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph

2021 ◽  
Vol 348 ◽  
pp. 01001
Author(s):  
Paryati ◽  
Krit Salahddine
Keyword(s):  
Shortest Path ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Application System ◽  
Path Creation ◽  
Dijkstra's Algorithm

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the existence of weight sorting will facilitate the search for the shortest path. And considering the characteristics of Kruskal’s independent algorithm, it will facilitate and improve the formation of the path. The weakness of the Kruskal algorithm is that if the number of nodes is very large, it will be slower than Dijkstra’s algorithm because it has to sort thousands of vertices first, then form a path.

scholarly journals Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.

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

SISTEMASI ◽  
2022 ◽  
Vol 11 (1) ◽  
pp. 160
Author(s):  
Rosyid Ridlo Al Hakim ◽  
Purwono Purwono ◽  
Yanuar Zulardiansyah Arief ◽  
Agung Pangestu ◽  
Muhammad Haikal Satria ◽  
...  
Keyword(s):  
Information Technology ◽  
Programming Language ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Global Pandemic ◽  
Android Os ◽  
Shortest Distance ◽  
The World

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.

Research on emergency rescue plan of plateau area after earthquake based on road accessibility

2020 ◽  
Author(s):  
Junming Li
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Mountainous Areas ◽  
The Road ◽  
Emergency Rescue ◽  
Dijkstra's Algorithm ◽  
Plateau Area

<p>Road damage in plateau mountainous areas has a significant impact on emergency rescue, and the size of the area where emergency rescue vehicle teams travel at different rescue stages is different, which also gives rise to different considerations of road demand. Current research finds that the respective characteristics of Dijkstra's algorithm and ant colony algorithm can meet the different needs of emergency rescue vehicle teams when they are traveling at different regional sizes. Therefore, the article simulates the earthquake and calculates the road accessibility results after the earthquake, and then considers the differences in road demand and considers the size of different regions, the Dijkstra algorithm and the ant colony algorithm are used respectively to plan the overall emergency rescue plan by setting different scenarios. The results show that the emergency rescue-planning route in different scenarios provided by the plan is scientific and reasonable, and can provide support in the research of key links.</p>

scholarly journals Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train

2019 ◽  
Vol 7 (2) ◽  
pp. 8
Author(s):  
Tri Setya Dermawan
Keyword(s):  
Programming Language ◽  
Time Complexity ◽  
Route Discovery ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Web Based ◽  
Dijkstra's Algorithm ◽  
Comparison Results ◽  
Minimum Price ◽  
Memory Complexity

Abstract - The best route is the path found based on the minimum price of a train journey using the Dijkstra and Floyd-Warshall algorithms. This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. The results of these two algorithms are compared using 4 parameters: time complexity, memory complexity, level of completion and level of optimization.Based on the comparison results from the implementation that Dijkstra's algorithm has a time complexity of 81 faster than the Floyd-Warshall algorithm. For the memory complexity, Dijkstra's algorithm uses a memory of 512616 bytes less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes less than the Floyd-Warshall algorithm. For the level of completion of the two algorithms, there is no error. In addition, for the level of optimization the Dijkstra algorithm has advantages in this study, namely the data used is dynamic or variable data in each stage of the process.

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

2021 ◽  
Vol 66 (3) ◽  
pp. 81-90
Author(s):  
Giang Vu Thai ◽  
Ngan Nguyen Thi Kim ◽  
Hoan Nguyen Ba ◽  
Duc Bui Minh
Keyword(s):  
Waiting Time ◽  
Minimum Time ◽  
Experimental Results ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Traffic Jams ◽  
Dijkstra's Algorithm

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.

scholarly journals The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph

2021 ◽  
Vol 297 ◽  
pp. 01062
Author(s):  
Paryati ◽  
Krit Salahddine
Keyword(s):  
Shortest Path ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Application System ◽  
Path Creation ◽  
Dijkstra's Algorithm

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the existence of weight sorting will facilitate the search for the shortest path. And considering the characteristics of Kruskal’s independent algorithm, it will facilitate and improve the formation of the path. The weakness of the Kruskal algorithm is that if the number of nodes is very large, it will be slower than Dijkstra’s algorithm because it has to sort thousands of vertices first, then form a path.

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

2021 ◽  
Vol 10 (10) ◽  
pp. 216-221
Author(s):  
Samir Dey ◽  
Sriza Malakar ◽  
Shibnath Rajak
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Numerical Example ◽  
Network Problem ◽  
Dijkstra's Algorithm

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.

scholarly journals Dijkstra Algorithm for Determining the Shortest Path in the Case of Seven Hotels in Manado City Towards Manado’s Sam Ratulangi Airport.

d'CARTESIAN ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 158
Author(s):  
Yohana Permata Hutapea ◽  
Chriestie E.J.C. Montolalu ◽  
Hanny A.H. Komalig
Keyword(s):  
Graph Theory ◽  
Travel Time ◽  
Shortest Path ◽  
Travel Distance ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Google Maps ◽  
Transportation Mode ◽  
Dijkstra's Algorithm ◽  
The Difference

Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.

Sign in / Sign up

Export Citation Format

Share Document