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

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

<p>Diera industri 4.0, penggunaan peta tidak lagi berbentuk lembaran ataupun buku. Kini terdapat sebuah layananan peta digital yaitu <em>platform</em> 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 <em>real </em>yaitu menampilkan lokasi sebenarnya menggunakan <em>platform</em> Leaflet.js dan parameter yang berbeda, dari hal tersebut penelitian ini akan membandingkan kinerja dari Algoritma <em>Dijkstra</em>, A* dan <em>Floyd Warshall</em> 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 <em>Dijkstra</em> sebesar 0,0060 detik, algoritma A* sebesar 0,0067 dan algoritma <em>Floyd Warshall</em> sebesar 0,0433 detik. Berdasarkan hasil tersebut bahwa algoritma  <em>Dijkstra</em> lebih unggul dalam proses pencarian rute.</p><p> </p><p><em><strong>Abstract</strong></em></p><p><em>In 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.</em></p><p><em><strong><br /></strong></em></p>

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 A Bi-Level Path Planning Algorithm for Multi-AGV Routing Problem

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1351
Author(s):  
Zhiheng Yuan ◽  
Zhengmao Yang ◽  
Lingling Lv ◽  
Yanjun Shi
Keyword(s):  
Path Planning ◽  
Random Trees ◽  
Dijkstra Algorithm ◽  
A Algorithm ◽  
Routing Problem ◽  
Agv Routing ◽  
Planning Algorithm ◽  
Local Grid ◽  
Local Path ◽  
Path Planning Algorithm

Avoiding the multi-automated guided vehicle (AGV) path conflicts is of importance for the efficiency of the AGV system, and we propose a bi-level path planning algorithm to optimize the routing of multi-AGVs. In the first level, we propose an improved A* algorithm to plan the AGV global path in the global topology map, which aims to make the path shortest and reduce the AGV path conflicts as much as possible. In the second level, we present the dynamic rapidly-exploring random trees (RRT) algorithm with kinematic constraints to obtain the passable local path with collisions in the local grid map. Compared to the Dijkstra algorithm and classic A* algorithm, the simulation results showed that the proposed bi-level path planning algorithm performed well in terms of the search efficiency, significantly reducing the incidence of multiple AGV path conflicts.

scholarly journals Automatic Generation of Multidestination Routes for Autonomous Wheelchairs

2020 ◽  
Vol 32 (6) ◽  
pp. 1121-1136
Author(s):  
Yusuke Mori ◽  
◽  
Katashi Nagao
Keyword(s):  
Texture Analysis ◽  
Minimum Cost ◽  
Automatic Generation ◽  
The Self ◽  
The Road ◽  
Road Surfaces ◽  
Surface Image ◽  
Route Information ◽  
The Cost ◽  
Route Search

To solve the problem of autonomously navigating multiple destinations, which is one of the tasks in the Tsukuba Challenge 2019, this paper proposes a method for automatically generating the optimal travel route based on costs associated with routes. In the proposed method, the route information is generated by playing back the acquired driving data to perform self-localization, and the self-localization log is stored. In addition, the image group of road surfaces is acquired from the driving data. The costs of routes are generated based on texture analysis of the road surface image group and analysis of the self-localization log. The cost-added route information is generated by combining the costs calculated by the two methods, and by assigning the combined costs to the route. The minimum-cost multidestination route is generated by conducting a route search using cost-added route information. Then, we evaluated the proposed method by comparing it with the method of generating the route using only the distance cost. The results confirmed that the proposed method generates travel routes that account for safety when the autonomous wheelchair is being driven.

scholarly journals Pengembangan Sistem Informasi Geografi Bencana Alam Pada Kabupaten Madiun Berbasis Web Menggunakan Metode Build and Fix

2019 ◽  
Vol 3 (2) ◽  
Author(s):  
Ezra Gayu ◽  
Pradityo Utomo ◽  
Dwi Nor Amadi
Keyword(s):  
Information System ◽  
Natural Disasters ◽  
Natural Disaster ◽  
Disaster Management ◽  
System Development ◽  
Digital Map ◽  
Disaster Information ◽  
System Success ◽  
Map Service ◽  
Form Information

Development Natural Disaster Information Geografis System is a website service utilizing digital map service. To facilitate the Regional Disaster Management Agency (BPBD) and the Community of Madiun Regency in providing and receiving information about the occurrence of Natural Disasters in Madiun District, the need for the application of information systems. The information system can display the points where the Natural Disasters occur. With the Information System, everyone can see the location of the map of the disaster occurrence area along with the description of the area. in this study developed a "Natural Disaster Information System at Madiun district". System development using Build and Fix method, because it is considered fast in making the system. The built system can be expected to assist BPBD officers in performing their duties. So that the system built must have the ability to form information accurately the occurrence of natural disasters. Therefore, the disaster information system in Madiun district has been tested using blackbox method, with 100% system success rate. Keywords : Web, Madiun District, Natural Disaster, Information Geografis System, Build and Fix, Blackbox

scholarly journals A New Challenge: Path Planning for Autonomous Truck of Open-Pit Mines in The Last Transport Section

2020 ◽  
Vol 10 (18) ◽  
pp. 6622
Author(s):  
Ziyu Zhao ◽  
Lin Bi
Keyword(s):  
Path Planning ◽  
High Precision ◽  
Optimal Path ◽  
Transportation Cost ◽  
Open Pit ◽  
Open Pit Mining ◽  
A Algorithm ◽  
Digital Map ◽  
Elevation Data ◽  
Cutting Zone

During the operation of open-pit mining, the loading position of a haulage truck often changes, bringing a new challenge concerning how to plan an optimal truck transportation path considering the terrain factors. This paper proposes a path planning method based on a high-precision digital map. It contains two parts: (1) constructing a high-precision digital map of the cutting zone and (2) planning the optimal path based on the modified Hybrid A* algorithm. Firstly, we process the high-precision map based on different terrain feature factors to generate the obstacle cost map and surface roughness cost map of the cutting zone. Then, we fuse the two cost maps to generate the final cost map for path planning. Finally, we incorporate the contact cost between tire and ground to improve the node extension and path smoothing part of the Hybrid A* algorithm and further enhance the algorithm’s capability of avoiding the roughness. We use real elevation data with different terrain resolutions to perform random tests and the results show that, compared with the path without considering the terrain factors, the total transportation cost of the optimal path is reduced by 10%–20%. Moreover, the methods demonstrate robustness.

scholarly journals An efficient approach for solving Travelling Sales Man Problem

2021 ◽  
Vol 9 (8) ◽  
pp. 2793--2798
Author(s):  
Tirumalasetti Guna Sekhar
Keyword(s):  
Urban Communities ◽  
Shortest Path ◽  
Urban Areas ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Dijkstra Algorithm ◽  
A Algorithm ◽  
Fundamental Goal ◽  
Time And Space Complexity ◽  
The City

Abstract: Global Position System (GPS) application is quite possibly the most valuable instrument in transportation the executives nowadays. The Roadway transportation is an significant function of GPS. To track down the briefest courses to a spot is the key issue of organization investigation. To address this issue, we have numerous calculations and procedures like Dijkstra algorithm, Ant Colony Optimization, Bellman Portage Algorithm, Floyd-Warshall algorithm, Genetic Algorithm, A* Algorithm furthermore, numerous others. In this paper our fundamental goal is to assess the brute force algorithm and the dynamic programming algorithm in settling the Shortest path issue (The travelling salesman issue). The paper will be finished up by giving the results of time and space complexity of these algorithms. To help a salesman visit every one of the urban communities in the rundown (giving the area of urban areas as the information) and he knows the area of the multitude of urban communities and track down the shortest path with the end goal that he visits every one of the urban areas just a single time and gets back to the city where he begun. The distance (cost) and the relating way ought to be shown as yield.

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%.

Perbandingan Algoritma Horspool dan Algoritma Zhu-Takaoka dalam Pencarian String Berbasis Desktop

2017 ◽  
Vol 9 (1) ◽  
Author(s):  
Adhi Kusnadi ◽  
Abraham Khrisnandi Wicaksono
Keyword(s):  
Processing Time ◽  
Search Process ◽  
Text File ◽  
C Programming Language ◽  
Retrieval Systems ◽  
String Searching ◽  
C Programming ◽  
Information Retrieval Systems ◽  
Index Terms ◽  
Time Required

String searching is the search process by using the index to find text that can help in information retrieval systems. Continuing previous research, this study uses an algorithm Horspool and Zhu-Takaoka to find the performance of each of these algorithms in the search for a pattern in the text. So they make a useful desktop-based application to measure performance of both algorithm, particulary the time required to perform string searching process. Using the method of prototyping and Microsoft Visual Studio with C# programming language implementation. Result obtained from this application is the number of words found, and the processing time of each algorithm. From this study, the Horspool algorithm is 19,82845 percent faster in first test with the pattern "swan" in a text file 50 multiples 1000 words and 15.9442 percent in the second trial using text files 70000 words with different pattern than the number of characters Zhu algorithm -Takaoka in the process of searching string. Index Terms-String searching, Horspool, Zhu-Takaoka, Microsoft Visual Studio, application, processing time.

Target Searching of Mobile Robots Using Improved A* Searching Algorithm

2013 ◽  
Vol 300-301 ◽  
pp. 519-522 ◽  
Author(s):  
Chih Hung Chang ◽  
Jie Tong Zou ◽  
Kuo Lan Su
Keyword(s):  
Shortest Path ◽  
Dynamic Environment ◽  
Motion Path ◽  
Planning Problem ◽  
Dijkstra Algorithm ◽  
A Algorithm ◽  
Intelligent Node ◽  
Multiple Strategies ◽  
Time Motion ◽  
Target Searching

The paper studies motion path planning problem using improved A* searching algorithm, and implements the movement scenario using mobile robot system. Solving the shortest path problem, Dijkstra algorithm can finds the shortest path to solve the path searching problem. The searching depth is not applicable in certain circumstances to be a disadvantage. The paper proposed improved A* searching algorithm using the intelligent node judgment method, it not only be able to retain the advantages of the traditional A* algorithm but also improve the shortcomings. It programs the on-time motion path in dynamic environment; it also programs the motion path more closed to the best path. Finally, the paper uses multiple strategies to improve the searching motion path to be the best motion path, and compares with the traditional A* algorithm to reduce the searching time.

scholarly journals RANCANG BANGUN APLIKASI PEMETAAN DAERAH RAWAN KECELAKAAN BERBASIS ANDROID

2020 ◽  
Vol 15 (1) ◽  
pp. 26
Author(s):  
Novia Anggraini ◽  
Moh. Anshori Aris Widya ◽  
Siti Sufaidah
Keyword(s):  
Traffic Accident ◽  
Black Spot ◽  
Building Design ◽  
Transportation Safety ◽  
Z Score ◽  
Accident Rate ◽  
Digital Map ◽  
Gis Application ◽  
Accident Data ◽  
Map Service

Kecelakaan lalu lintas merupakan masalah yang membutuhkan penanganan serius mengingat besarnya kerugian yang diakibatkannya. Salah satu upaya untuk meningkatkan keselamatan transportasi yaitu dengan mengetahui titik lokasi rawan kecelakaan. Metode yang digunakan untuk mengidentifikasi lokasi rawan kecelakaan yaitu metode Angka kecelakaan dan frekuensi kecelakaan. Tujuan studi ini untuk mengidentifikasi titik lokasi rawan kecelakaan dengan menggunakan metode Batas Angka Ekivalen kecelakaan dan Z-Score. Data kecelakaan lalu lintas yang dianalisis bersumber dari satlantas Jombang dari tahun 2018 dan data yang bersumber dari media elektronik, variabel dummy dari tahun 2016 - 2019. Aplikasi rancang bangun daerah rawan kecelakaan Berbasis mobile, dibangun dengan framework Codeigniter dan Framework 7, MySql sebagai basis data dan Mapbox Api sebagai layanan peta digital.  Hasil akhir dari penelitian ini adalah terciptanya aplikasi SIG berbasis mobile yang menyajikan informasi titik lokasi rawan kecelakaan dan tingkat kerawanannya serta notifikasi kepada pengguna jika berada di radius titik rawan yang dapat diakses oleh masyarakat. AbstractTraffic accidents are a problem that requires serious treatment considering the amount of loss caused. One effort to improve transportation safety is to know the location of accident-prone locations. The method used to identify accident prone locations is the accident rate and frequency of accident methods. The purpose of the study is to identify accident prone locations by using the Accidental Equivalent Limit Limits and Z-Score methods. Traffic accident data analyzed were sourced from Jombang Satlantas from 2018 and data were sourced from electronic media, dummy variables from 2016 - 2019. Application of building design for accident-prone areas Based on mobile, built with Codeigniter frame and Framework 7, MySql as database and the Fire Mapbox as a digital map service. The final result of this study is the creation of a mobile-based GIS application that presents information on the location of accident-prone locations and their vulnerability levels as well as notifications to users if they are in a vulnerable point radius that can be accessed by the public.Keywords: Equivalent accident number (EEK); Black Spot; Framework7; SIG; Z-Score

Sign in / Sign up

Export Citation Format

Share Document