Shortest Path Search Futsal Field Location With Dijkstra Algorithm

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.

Download Full-text

Implementasi Algoritma Dijkstra Dalam Pembuatan Aplikasi Pesona Palu

ScientiCO Computer Science and Informatics Journal ◽

10.22487/j26204118.2018.v1.i1.11899 ◽

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.

Download Full-text

The shortest path search application based on the city transport route in Semarang using the Floyd-warshall algorithm

Journal of Physics Conference Series ◽

10.1088/1742-6596/1217/1/012116 ◽

2019 ◽

Vol 1217 ◽

pp. 012116

Author(s):

A Khamami ◽

R Saputra

Keyword(s):

Shortest Path ◽

Path Search ◽

The City ◽

Shortest Path Search

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

Perbandingan Perhitungan Manual dengan Algoritma A Star dalam Pencarian Jalur Terpendek untuk Pengiriman Pesan Dodol Khas Lombok

Jurnal Bumigora Information Technology (BITe) ◽

10.30812/bite.v1i2.610 ◽

2019 ◽

Vol 1 (2) ◽

pp. 154-160

Author(s):

Mayadi . ◽

Raisul Azhar

Keyword(s):

Shortest Path ◽

A Algorithm ◽

Path Search ◽

The Right ◽

The City ◽

Shortest Path Search ◽

Customer Orders

Abstrak Petugas pengiriman pesanan yang ada PT Phonix melakukan pengiriman pesanan dari gudang ke gerai gerai yang ada di kota mataram dengan melewati atau melintasi jalan yang sama, untuk meminimalkan jarak dan tujuan yang akan dituju maka diperlukan pencarian jalur terpendek dari gudang ke gerai gerai tujuan yang ada dikota mataram. Pencarian jalur terpendek adalah solusi yang tepat untuk mengirimkan pesanan dodol khas lombok ke pelanggan yang ada dikota mataram. Pencarian jalur terpendek pada penelitian ini bertujuan supaya dapat menentukan jalur mana yang paling cepat untuk dilalui atau dilintasi. Algoritma A* adalah salah satu metode yang bisa digunakan untuk pencarian jalur terpendek, dengan menggunakan metode ini diharapkan petugas pengiriman pesanan yang ada gudang dapat lebih cepat menemukan jalur mana yang paling dekat dan lebih cepat untuk menemukan goal pada pencarian jalur terpendek dalam proses pengiriman pesanan pelanggan dodol di daerah lombok dengan menggunakan algoritma A*. Dari penelitian ini melakukan dua proses pengujian yaitu pengujian menggunakan perhitungan manual dan pengujia menggunakan algoritma A*, dari pengujian secara manaual didapatkan jalur terpendek 15.750 dan dengan menggunakan algoritma A* didapatkan jalur terkecil 14.500, hingga pencarian dengan menggunakan perhitungan algoritma cukup biak. Abstract Existing order dispatcher PT Phonix orders shipments from the warehouse to outlets in the city of Mataram by passing or crossing the same road, to minimize the distance and destination to be addressed it is necessary to find the shortest path from the warehouse to the destination outlets in the city mataram. The shortest path search is the right solution for sending dodol orders typical to Lombok to customers in the city of Mataram. The search for the shortest path in this study aims to determine which path is the fastest to be traversed or crossed. Algorithm A * is one method that can be used to search for the shortest path, by using this method it is hoped that an order delivery officer in an existing warehouse can more quickly find the path which is the closest and faster to find a goal in the search for the shortest path in the process of sending customer orders dodol in the Lombok area using the A * algorithm. From this study conducted two testing processes, namely testing using manual calculations and testing using the A * algorithm, from which in the test obtained the shortest path of 15,750 and using the A * algorithm obtained the smallest path of 14,500, to the search using a fairly multiply algorithm calculation.

Download Full-text

Dijkstra Algorithm Application: Shortest Distance between Buildings

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i4.10.26638 ◽

2018 ◽

Vol 7 (4.10) ◽

pp. 974 ◽

Cited By ~ 1

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.

Download Full-text