Setiawan, Rifki (2024) Implementasi Algoritma A-Star Pada Pencarian Rute Terdekat Menghindari Jalan Rusak. Undergraduate thesis, UPN Veteran Jawa Timur.
|
Text (Cover)
19081010134-Cover.pdf Download (1MB) | Preview |
|
|
Text (Bab 1)
19081010134-BAB I.pdf Download (281kB) | Preview |
|
![[img]](http://repository.upnjatim.ac.id/style/images/fileicons/text.png) |
Text (Bab 2)
19081010134-BAB II.pdf Restricted to Registered users only until 19 January 2026. Download (599kB) |
|
|
Text (Bab 3)
19081010134-BAB III.pdf Restricted to Registered users only until 19 January 2026. Download (831kB) |
|
|
Text (Bab 4)
19081010134-BAB IV.pdf Restricted to Registered users only until 19 January 2026. Download (4MB) |
|
|
Text (Bab 5)
19081010134-BAB V.pdf Download (284kB) | Preview |
|
|
Text (Daftar Pustaka)
19081010134-Daftar Pustaka.pdf Download (234kB) | Preview |
|
|
Text (Lampiran)
19081010134-Lampiran.pdf Restricted to Registered users only until 19 January 2026. Download (303kB) |
Abstract
In everyday life, people often use roads as transportation infrastructure to get to their destination. However, not all roads have the same conditions. One of the challenges that road users often face is the existence of damaged roads so that road users have to think twice before choosing a route. Therefore, in dealing with damaged roads, sometimes road users have to look for other alternatives that are faster and more efficient. Technological advances can provide a solution to this problem in the form of a map system equipped with a rerouting feature. This research builds a web-based map system supported by several components such as road data derived from the OpenStreetMap database and the A-star algorithm used to find the shortest route. This website is designed using JavaScript, PHP, HTML and CSS programming languages. For the database, this website is supported by MYSQL which stores damaged road data and user account data. The flow of this website starts with registering and logging in an account after that users can use the maps data that has appeared on the main page and users can report damaged roads supported by photo evidence with a watermark of the time taken and the coordinate data of the damaged road. After that the admin of the website can validate the damaged road data so that the initial route that should pass through the damaged road will change the road route with an alternative node. The level of accuracy of the A-Star Algorithm in finding the closest route to avoid damaged roads can be obtained by how much damaged road data has been entered and validated by the admin as a whole and complete, the level of accuracy of short routes avoiding damaged roads will reach satisfactory with evidence of testing 5 different routes. KEYWORDS : Algoritma A-Star, Locations, Nodes, Broken Roads, Maps
| Item Type: | Thesis (Undergraduate) | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Contributors: |
|
||||||||||||
| Subjects: | T Technology > T Technology (General) | ||||||||||||
| Divisions: | Faculty of Computer Science > Departemen of Informatics | ||||||||||||
| Depositing User: | Rifki Setiawan | ||||||||||||
| Date Deposited: | 19 Jan 2024 09:21 | ||||||||||||
| Last Modified: | 19 Jan 2024 09:21 | ||||||||||||
| URI: | http://repository.upnjatim.ac.id/id/eprint/20258 |
Actions (login required)
 |
View Item |