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

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.

Download Full-text

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

SISTEMASI ◽

10.32520/stmsi.v11i1.1667 ◽

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.

Download Full-text

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

E3S Web of Conferences ◽

10.1051/e3sconf/202016410016 ◽

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.

Download Full-text

Analisis Perbandingan Algoritma Djikstra, A-Star, dan Floyd Warshall dalam Pencarian Rute Terdekat pada Objek Wisata Kabupaten Dompu

Jurnal Teknologi Informasi dan Ilmu Komputer ◽

10.25126/jtiik.0812866 ◽

2021 ◽

Vol 8 (2) ◽

pp. 227

Author(s):

Rusydi Umar ◽

Anton Yudhana ◽

Andi Prayudi

Keyword(s):

Processing Time ◽

Search Process ◽

Dijkstra Algorithm ◽

A Algorithm ◽

Digital Map ◽

Real Objects ◽

Route Information ◽

Map Service ◽

Route Search ◽

Tourist Information

Diera industri 4.0, penggunaan peta tidak lagi berbentuk lembaran ataupun buku. Kini terdapat sebuah layananan peta digital yaitu platform Leafleat.js, yang memudahkan penggunanya untuk mendapatkan informasi rute dari objek ke objek lainnya dan mencari lokasi hampir diseluruh dunia. Pada penelitian ini menggunakan objek yang real yaitu menampilkan lokasi sebenarnya menggunakan platform Leaflet.js dan parameter yang berbeda, dari hal tersebut penelitian ini akan membandingkan kinerja dari Algoritma Dijkstra, A* dan Floyd Warshall untuk menentukan waktu proses pencarian rute terdekat dari objek wisata ke objek wisata lain menggunakan bahasa pemograman PHP. Hasil pengujian program didapatkan jarak dan rute yang sama serta rata-rata waktu proses program yang berbeda. Waktu proses algoritma Dijkstra sebesar 0,0060 detik, algoritma A* sebesar 0,0067 dan algoritma Floyd Warshall sebesar 0,0433 detik. Berdasarkan hasil tersebut bahwa algoritma Dijkstra lebih unggul dalam proses pencarian rute. AbstractIn the industrial era 4.0, the use of maps is no longer made of book sheets. Now a digital map service is available, the Leafleat.js platform, which provides users to get route information from other attractions and find locations that have been saved by the world. In this study using real objects that display the actual location using the Leaflet.js platform and different parameters, from this study will compare the performance of the Dijkstra, A * and Floyd Warshall Algorithms for the process of finding other tourist information using the PHP programming language. The results of testing the program obtained the same distance and route with different program processing time. Dijkstra algorithm processing time is 0.0060 seconds, A* algorithm is 0.0067 and Floyd Warshall algorithm is 0.0433 seconds. Based on these results, Dijkstra is superior in the route search process.

Download Full-text

APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH

E-Jurnal Matematika ◽

10.24843/mtk.2021.v10.i03.p339 ◽

2021 ◽

Vol 10 (3) ◽

pp. 173

Author(s):

RENDI SAPUTRAMA ◽

HARTATIANA HARTATIANA

Keyword(s):

Graph Theory ◽

Directed Graph ◽

Applied Research ◽

Dijkstra’S Algorithm ◽

The Road ◽

Dijkstra's Algorithm ◽

Shortest Route ◽

Starting Point ◽

Route Option

Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application of graph theory by using Dijkstra's Algorithm becomes a solution for this problem. This algorithm has the advantage to minimize the expense of the costs by finding the shortest route from starting point to the destination. This study is applied research. The study will discuss the determination of the origin and destination end-point, traverse route, the calculation of the weight distance, analyzes the Dijkstra's iteration to determine the shortest route, and conclusion. As the result, the land route becomes the shortest route option from UIN Raden Fatah Campus A to B. The directed graph of the route represents the location as point, the road as the side, and distance as weight. The result shows that the route distance is 6.94 km using Dijkstra's Algorithm.

Download Full-text

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

MATEC Web of Conferences ◽

10.1051/matecconf/202134801001 ◽

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.

Download Full-text

PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN

AL ULUM JURNAL SAINS DAN TEKNOLOGI ◽

10.31602/ajst.v7i1.5710 ◽

2022 ◽

Vol 7 (1) ◽

Author(s):

Abdul Alfattah Hidayah

Keyword(s):

Weighted Graph ◽

Dijkstra Algorithm ◽

Positive Weight ◽

Transportation Services ◽

Service Companies ◽

Transportation Service ◽

Shortest Route ◽

Shortest Distance ◽

Weight Value ◽

Main Attraction

This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous opportunity where the human population is very large. increased, and some human activities had to be carried out. fulfilled. Some online transportation service companies use paid features provided by Google to determine the shortest distance and route, thus costing a lot of money. In this study, to determine the shortest route on a journey, it is necessary to calculate using an algorithm method, namely the dijkstra algorithm which is an algorithm used to solve the problem of the shortest route or the shortest path from one point to another at a point. weighted graph, The distance between vertices is the weight value of each edge in the graph. A graph that has a weight must be positive (weight >= 0). Dijkstra's algorithm itself uses a greedy strategy in its operation, where in each step the chosen one with the smallest weight connects the selected node with other nodes that have not been selected. Keywords: dijkstra algorithm, online transportation service, shortest route,

Download Full-text

MENENTUKAN RUTE TERPENDEK DENGAN MENGGUNAKAN ALGORITMA FLOYD-WARSHALL DALAM PENDISTRIBUSIAN BARANG PADA PT. RAPY RAY PUTRATAMA

KARISMATIKA: Kumpulan Artikel Ilmiah, Informatika, Statistik, Matematika dan Aplikasi ◽

10.24114/jmk.v4i1.11857 ◽

2018 ◽

Vol 4 (1) ◽

Author(s):

M Ridwan Mukti ◽

Mulyono . .

Keyword(s):

Shortest Path ◽

Minimum Distance ◽

Shortest Path Problem ◽

Search Result ◽

Shortest Route ◽

Shortest Distance ◽

Path Search ◽

Distance Data ◽

Shortest Path Search ◽

Route Search

ABSTRAKMasalah pendistribusian pada perusahaan adalah masalah yang sangat penting untuk diperhatikan. Pada dasarnya pendistribusian barang akan sangat menghemat perusahaan dalam berbagai hal.Pencarian rute terpendek yang dilakukan pada PT. Rapy Ray Putratama Medan dilakukan dengan menghubungkan berbagai macem outlet dan juga termasuk beberapa outletnya adalah PT. Rapy Ray Putratama cabang medan. Permasalah rute terpendek ini dapat disesaikan dengan menggunakan salah satu metode pencarian rute terpendek yaitu algoritma Floyd-Warshall. Penelitian ini bertujuan untuk mengetahui hasil dari rute yang akan dipilih sebagai saran atau masukan kepada Perusahaan. Untuk hasil pencarian rute terpendek dengan menggunakan algoritma Floyd-Warshallyang diimplementasikan dalam pemrograman Codeblocks:: adalah jarak dari PT ke outlet maupun dari outlet ke outlet memiliki jarak yang paling minimum. Setelah itu, dapat ditentukan rute terpendek yang akan dipilih oleh salesman dalam pendistribusian yang telah didapatkan pada program tersebut. Data yang diinput adalah data jarak. Output yang dihasilkan program adalah jarak terpendek. Dengan penghematan jarak yang telah dilakukan. Pembentukan rute usulan yang dihasilkan dengan menggunakan metode algoritma Floyd-Warshall menghasilkan rute yang lebih dekat dengan total jarak penghematan adalah 10.97 % (51.304 km).Kata kunci: Pendistribusian, Pencarian rute terpendek, algoritma Floyd-Warshall. ABSTRACTThe problem of distribution to the company is a very important issue to notice. Basically the distribution of goods will greatly save the company expense in various ways. The searching for the shortest route done at PT. Rapy Ray Putratama Medan conducted by connecting various kinds of outlets and also including some outlets at PT. Rapy Ray Putratama Medan branch. This shortest path problem can be solved by using one of the shortest path search methods the Floyd-Warshall algorithm. This study aims to determine the results of the route to be selected as advice or input to the company. For the shortest route search result using Floyd-Warshall algorithm implemented in codeblocks programming is the distance from PT. Rapy Ray Putratamata outlet and from outlet to outlet which has the minimum distance. Subsequently, it can be determined the shortest route that will be selected by the salesman in the distribution that has been attained on the program. The inputted data is the distance data. The output produced by the program is the shortest distance by saving the distance that has been done through the algorithm. The proposed route formatted using the Floyd-Warshall algorithm method resulted in a route closer to the total distance of a saving distance of 10.97% (51,304 km). Keywords: Distribution, the shortest path searching, Floyd-Warshall algorithm.

Download Full-text

A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

Jurnal Pilar Nusa Mandiri ◽

10.33480/pilar.v16i1.1199 ◽

2020 ◽

Vol 16 (1) ◽

pp. 65-70

Author(s):

Siti Lestari Lestari ◽

Ardiansyah Ardiansyah ◽

Angelina Puput Giovani ◽

Desy Dwijayanti

Keyword(s):

Artificial Intelligence ◽

Problem Solving ◽

Shortest Path ◽

Rapid Development ◽

Residential Area ◽

Daily Activities ◽

Dijkstra Algorithm ◽

Shortest Route ◽

Shortest Distance ◽

Algorithm Implementation

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

Download Full-text

Reliability study on the adaptation of Dijkstra’s algorithm for gateway KLIA2 indoor navigation

Bulletin of Electrical Engineering and Informatics ◽

10.11591/eei.v9i2.2081 ◽

2020 ◽

Vol 9 (2) ◽

Author(s):

K. A. F. A. Samah ◽

A. A. Sharip ◽

I. Musirin ◽

N. Sabri ◽

M. H. Salleh

Keyword(s):

Indoor Environment ◽

Indoor Navigation ◽

Dijkstra’S Algorithm ◽

Reliability Study ◽

Dijkstra's Algorithm ◽

Current Location ◽

Shortest Distance ◽

Level 2 ◽

Test Result

This paper describes a reliability study on the adaptation of Dijkstra’s Algorithm (DA) in the indoor environment for navigation purposes. Gateway KLIA2 located at Sepang, Selangor, Malaysia has been chosen as the area for case study. Gateway KLIA2 is divided into 4 levels but this research focused on Level 2 only that consists of 129 shop lots. A survey conducted towards 68 public respondents before the adaptation and most of them responded that they are not aware of the surrounding of KLIA2 and are facing difficulties in finding the information or location of certain places inside the building. DA was chosen because it helps the users to navigate using the shortest path to destination. It is proven that through the adaptation of DA, we are able to provide the shortest distance for indoor navigation from current location to the destination location. G-INS is reliable based on the functionality and reliability testing conducted towards 15 users with the distance reduction of 47% t-test result of 0.01303 (p0.05), indicates the system is accepted

Download Full-text

Shortest Path Finding Using Dijkstra’s Algorithm

PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic ◽

10.33558/piksel.v9i1.2365 ◽

2021 ◽

Vol 9 (1) ◽

pp. 89-102

Author(s):

Fitri Yani Nurhasanah ◽

Windu Gata ◽

Dwiza Riana ◽

Muh. Jamil ◽

Surya Fajar Saputra

Keyword(s):

Shortest Path ◽

Work Ethic ◽

Dijkstra’S Algorithm ◽

Professional Work ◽

The Road ◽

Effective Time ◽

Employee Discipline ◽

Dijkstra's Algorithm ◽

Shortest Route ◽

On The Road

In the professional work, discipline is a very important to see work ethic of an employee. Discipline has also the most important element of good behavior, both as individual and social. A problem is when people on the road in finding the shortest path in order to get to the destination on time. Finding shortest path improves workers discipline and add value to employees. With the Dijkstra’s Algorithm, we can find the shortest route. The value on the edge of a graph can be expressed as the distance between nodes (roads). Through this proposed application, it easier for us to find the shortest route in a more effective time.

Download Full-text