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

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.

scholarly journals Dijkstra Algorithm Application: Shortest Distance between Buildings

2018 ◽  
Vol 7 (4.10) ◽  
pp. 974 ◽  
Author(s):  
G. Deepa ◽  
Priyank Kumar ◽  
A. Manimaran ◽  
K. Rajakumar ◽  
V. Krishnamoorthy
Keyword(s):  
Shortest Path ◽  
Engineering Calculation ◽  
Destination Node ◽  
Efficiency Improvement ◽  
Storage Space ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Basic Concepts

The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve. 

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.

Pursuit Algorithm for Robot Trash Can Based on Fuzzy-Cell Decomposition

2016 ◽  
Vol 6 (6) ◽  
pp. 2863
Author(s):  
Tatiya Padang Tunggal ◽  
Andi Supriyanto ◽  
Nur Mukhammad Zaidatur Rochman ◽  
Ibnu Faishal ◽  
Imam Pambudi ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Shortest Path ◽  
Cell Decomposition ◽  
Robot Path Planning ◽  
Shortest Distance ◽  
Artificial Intelligence Algorithm ◽  
Time Required ◽  
Fuzzy Cell ◽  
Destination Point ◽  
Robot Path

<p>Scooby Smart Trash can is a trash can equipped with artificial intelligence algorithms that is able to capture and clean up garbages thrown by people who do not care about the environment. The can is called smart because it acts like scoobydoo in a children's cartoon in that the can will react if there is garbage thrown and it catches and cleans them up. This paper presents pursuit algorithm that uses cell decomposition algorithm in which algorithms are used to create a map of the robot's path and fuzzy algorithm as one of the artificial intelligence algorithm for robot path planning. By using the combined algorithms, the robot is able to pursuit and chases the trash carelessly discarded, but it has not been able to find the shortest distance. Therefore, this paper considers a second modification of the algorithm by adding a potential field algorithm used to add weight values on the map, so that the robot can pursue trash by finding the shortest path. The proposed algorithm shows that the robot can avoid obstacles and find the shortest path so that the time required to get to the destination point is fast.</p>

scholarly journals PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN

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,

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

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.

scholarly journals Shortest Path Search Futsal Field Location With Dijkstra Algorithm

2018 ◽  
Vol 12 (2) ◽  
pp. 161 ◽  
Author(s):  
Delpiah Wahyuningsih ◽  
Erzal Syahreza
Keyword(s):  
Shortest Path ◽  
Destination Node ◽  
Dijkstra Algorithm ◽  
Initial Node ◽  
Shortest Route ◽  
Path Search ◽  
Surrounding Areas ◽  
The City ◽  
Shortest Path Search

Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.

scholarly journals Algoritma Dijkstra untuk Penentuan Jarak Tempuh Terpendek Pengantaran Katering Pabrik

MIND Journal ◽  
2021 ◽  
Vol 5 (2) ◽  
pp. 108-120
Author(s):  
THETA DINNARWATY PUTRI ◽  
WINARNO SUGENG ◽  
EKA SAFITRI
Keyword(s):  
Artificial Intelligence ◽  
Travel Time ◽  
Shortest Path ◽  
Dijkstra Algorithm ◽  
Initial Location ◽  
The City

AbstrakAlgoritma Dijkstra digunakan untuk menemukan jalur terpendek antara titik pada graf dan persamaan Haversine digunakan untuk mengukur jarak dari lokasi awal menuju lima lokasi tujuan yang mana lokasi tersebut merupakan pabrik yang berada di kota Cikarang dan lokasinya ada di sekitaran penyedia rumah catering. Perhitungan dilakukan setelah sistem mendapatkan koordinat latitude dan longitude pengguna dan lokasi pabrik yang dituju. Pada penelitian ini, lokasi pengguna dan lokasi pabrik dilakukan di kota Cikarang. Sistem mampu menampilkan prediksi jarak dan waktu tempuh untuk  rekomendasi dari urutan lima pengantaran dengan penerapan metode algoritma Dijkstra dimana proses yang dilakukan sistem adalah memperhitungkan jarak menggunakan Haversine Formula, sehingga didapatkan waktu tempuh berdasarkan parameter kemacetan. selain itu API mampu memvisualisasikan rute setiap tujuan dari titik lokasi katering.Kata kunci: Dijkstra, Formula Haversine, PHP, Jarak terpendek, Kecerdasan Buatan.AbstractThe algorithm is used to find the shortest path between points on a graph. The Haversine formula is used to measure the distance from the initial location to the five destination locations where the factory is located in Cikarang and the location is around the location catering house. Calculations are carried out after the system gets the user’s latitude and longitude coordinates and the intended factory. In this study, the location of the user and the location of the factory were carried out in the city of Cikarang. The system is suitable to display distance and travel time predictions for recommendations from the order of five deliveries by applying the Dijkstra algorithm method. The process that is carried out by the system, calculates the distance using Haversine formula. Thus, the travel time is obtained bases on congestion parameters. In Addition, besides the API is able to visualize the route of each destination from the catering location point.Keywords: Dijkstra, Haversine Formula, PHP, Shortest Path, Artificial Intelligence.

scholarly journals Aplikasi Pemandu Pencarian Wisata Terdekat Berbasis GIS Android Dengan Algoritma Dijkstra

2019 ◽  
Vol 3 (1) ◽  
pp. 91
Author(s):  
Khairil Anam ◽  
Ony Dwi Hartono
Keyword(s):  
Search Algorithm ◽  
Rapid Development ◽  
Geographical Information ◽  
Tourist Attraction ◽  
Android Application ◽  
Dijkstra Algorithm ◽  
Tourist Attractions ◽  
Shortest Route ◽  
Tourism Sector ◽  
Route Search

Sumenep Regency is one of the districts on Madura Island where the tourism sector is experiencing rapid development and improvement. Sumenep Regency has a natural and cultural tourist attraction, making it a destination for tourists. Not only is the attraction of the culture of his cow easy, but Sumenep Regency has a very beautiful natural attraction. The condition of natural tourism consists of natural scenery, high hills, beaches, high asta and diversity of marine potential. One of the popular tourist objects is Pantai Pantai Sembilan, Gili Labak Island and Gilii which have the best oxygen levels in the world. Tourists from outside the region, especially those who first visited Sumenep Regency will have a little difficulty in accessing tourist attractions in this city because they do not know in detail the information about the location of these tourist attractions. The purpose of this research is to build an Android-based Geographical Information System using the Dijkstra Algorithm, which is expected to help tourists from outside the Sumenep City area in displaying routes from one tourist spot to another. The method that is the basis for designing this GIS is the Graph Method, by applying the shortest route search algorithm, Dijkstra's Algorithm. The expected results with this application are that it can help, simplify, and accelerate tourists in finding and obtaining information about the location of tourist attractions in Sumenep Regency. Based on the closest travel search trials using the Android Application it produces an accuracy of 95%.

scholarly journals IMPLEMENTASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN JALUR TERPENDEK DALAM DISTRIBUSI BARANG

2021 ◽  
Vol 2 (2) ◽  
pp. 194-203
Author(s):  
Ikhsan Baharudin ◽  
Ahmad Jaka Purwanto ◽  
Teguh Rahayu Budiman ◽  
Muchammad Fauzi
Keyword(s):  
Shortest Path ◽  
Manufacturing Industry ◽  
Optimal Path ◽  
Transportation Costs ◽  
Project Work ◽  
Shortest Route ◽  
Regular Customer ◽  
Shortest Distance ◽  
The Cost ◽  
A Company

PT. X is a company domiciled in Gedebage, Bandung which is engaged in the manufacturing industry by producing precision parts using CNC machines. PT. X is a sub-contracting company that usually serves project work from other companies. PT. Y and PT. Z is a regular customer who often works with PT. X. So that PT. X often sends finished products directly to PT. Y who is domiciled on Jl. Gatot Subroto, Bandung and also PT. Z who is domiciled on Jl. Pajajaran, Bandung. To minimize the cost of distribution of goods, PT. X must determine an adequate path taking into account the optimization of transportation costs. One of the variables that affect transportation costs is distance. It is assumed that the optimal path for transportation costs is the shortest distance using the Dijkstra method. This test uses data from Google Maps to find out the distance to each destination, making it easier to get the shortest path. Obtained the shortest path from PT. X to PT.Y is 12.3 Km via West Java Police then Carefour, while the shortest route is from PT. Y to PT. Z is 10.7 Km via Simpang Lima then Vie Hotel Westhoff. So that the optimal total mileage for distributing goods is 23 Km.

scholarly journals Implementasi Algoritma Dijkstra Dalam Pembuatan Aplikasi Pesona Palu

2019 ◽  
Vol 1 (1) ◽  
pp. 25
Author(s):  
Yusuf Anshori ◽  
Yuri Yudhaswana Joefrie ◽  
Nadyanti Nadyanti
Keyword(s):  
Directed Graph ◽  
Shortest Path ◽  
Solution Set ◽  
Dijkstra Algorithm ◽  
Culinary Tourism ◽  
Shortest Route ◽  
Android Platform ◽  
The City

This study aims to build application that is able to provide information on the location of culinary tourism, shopping and recreation center for the area of Palu City that runs on the Android platform and able to show the closest path to be traversed in order to help tourists or newcomers who are not too familiar with the city of Palu. Determination of the shortest route in this application using Dijkstra algorithm. This algorithm is used to find the shortest path on a directed graph. This algorithm uses the Greedy principle which states that at each step we choose the minimum-weighted side and put it into the solution set.

Sign in / Sign up

Export Citation Format

Share Document