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

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

Accelerating Traffic Assignment with Customizable Contraction Hierarchies

Transportation Research Record Journal of the Transportation Research Board ◽

10.1177/0361198119898455 ◽

2020 ◽

Vol 2674 (1) ◽

pp. 188-196 ◽

Cited By ~ 2

Author(s):

Arne Schneck ◽

Klaus Nökel

Keyword(s):

Shortest Path ◽

Traffic Assignment ◽

Shortest Path Problem ◽

Transport Modeling ◽

The Past ◽

Acceleration Techniques ◽

Network Loading ◽

Enormous Amount ◽

Path Search ◽

Shortest Path Search

In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O–D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques for the shortest path problem in road networks in the past decade. These techniques usually divide the problem into a relatively expensive preprocessing phase and a significantly accelerated search phase. In this paper, the recently developed customizable contraction hierarchies are used for both shortest path search and network loading in the bi-conjugate Frank–Wolfe algorithm. For the largest test network, this approach achieves a speedup by a factor of 42 compared with a straightforward implementation of Dijkstra’s algorithm.

Download Full-text

Shortest Path Search Futsal Field Location With Dijkstra Algorithm

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) ◽

10.22146/ijccs.34513 ◽

2018 ◽

Vol 12 (2) ◽

pp. 161 ◽

Cited By ~ 1

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.

Download Full-text

EFS: Entropy First Search for Dynamic Shortest Path Problem in Large Sparse Graphs

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2017.6330 ◽

2017 ◽

Vol 14 (1) ◽

pp. 367-383

Author(s):

Quan Zhou ◽

Hui Zhao ◽

Huijie Zhang ◽

Shulin Tian ◽

Zhen Liu

Keyword(s):

Shortest Path ◽

Shortest Paths ◽

Shortest Path Problem ◽

Search Process ◽

Single Source ◽

Solution Path ◽

Sparse Graphs ◽

Path Search ◽

Speed Up ◽

Shortest Path Search

Searching the dynamic shortest path is a hot topic recently. In this paper we proposed a new method to solve the dynamic single source shortest paths (SSSP) problem in sparse graphs. The main contributions are three: firstly, in the preprocessing stage, we use the unreachable and unstartable characteristics to avoid most of the non-solution path search. Secondly, Entropy first search (EFS) is introduced to speed up the search process in finding the possible shortest path and then the algorithm can converges as soon as possible. In addition, the update algorithm for dynamic shortest path search is proposed for practical use. The experiments in large random sparse graphs show the efficiency and benefits of the proposed method.

Download Full-text