Tito Candra Septio, . (2024) PERANCANGAN APLIKASI PENENTUAN RUTE TERCEPAT MENUJU OBJEK WISATA DI JAKARTA MENGGUNAKAN BRT (BUS RAPID TRANSIT) TRANSJAKARTA DENGAN OPTIMASI HEAP PADA ALGORITMA DIJKSTRA. Skripsi thesis, Universitas Pembangunan Nasional Veteran Jakarta.
![[img]](http://repository.upnvj.ac.id/style/images/fileicons/text.png) |
Text
ABSTRAK.pdf Download (136kB) |
|
Text
AWAL.pdf Download (1MB) |
|
Text
BAB I.pdf Restricted to Repository UPNVJ Only Download (215kB) |
|
Text
BAB II.pdf Restricted to Repository UPNVJ Only Download (2MB) |
|
Text
BAB III.pdf Restricted to Repository UPNVJ Only Download (267kB) |
|
Text
BAB IV.pdf Restricted to Repository UPNVJ Only Download (4MB) |
|
Text
BAB V.pdf Download (169kB) |
|
Text
DAFTAR PUSTAKA.pdf Download (183kB) |
|
Text
DAFTAR RIWAYAT HIDUP.pdf Restricted to Repository UPNVJ Only Download (336kB) |
|
Text
LAMPIRAN.pdf Restricted to Repository UPNVJ Only Download (9MB) |
|
Text
HASIL PLAGIARISME.pdf Restricted to Repository staff only Download (3MB) |
|
Text
ARTIKEL KI.pdf Restricted to Repository staff only Download (1MB) |
Abstract
DKI Jakarta Province is a city with an economic center and is a city rich in tourist destinations, making many people live in this province. According to BPS statistical data, the population of DKI Jakarta continues to increase every year. As the population increases, the number of vehicles owned also increases, causing problems in the form of traffic jams. One of the solutions adopted by the government to overcome this problem is to introduce Transjakarta to help the mobility of the people of DKI Jakarta to be more efficient. Another problem is when buses use routes that are used by other public transportation, such as non-BRT services, this will lead to traffic jams, resulting in additional travel time, especially on holidays when most people will travel to tourist attractions. For this reason, the public or tourists also need to know which routes are used by the Transjakarta BRT so that the routes used are not mixed with other public transportation so that they do not hinder travel. The complexity of the route information provided by Transjakarta and the lack of information to find the quickest route to tourist attractions apart from asking the relevant officers, means that the public has to reprocess the existing information. Through this research, the author designed an application that can determine the fastest and closest possible route to tourist attractions via the BRT route. This research uses the Dijkstra algorithm which is optimized using a heap in route search. The research results show the success of the algorithm in providing the fastest route information from the starting point to the destination tourist attraction point and succeeding in improving the algorithm's performance when compared to the Dijkstra algorithm without heap.
| Item Type: | Thesis (Skripsi) |
|---|---|
| Additional Information: | [No.Panggil: 2010511142] [Pembimbing: Widya Cholil ] [Penguji 1: Musthofa Galih Pradana] [Penguji 2: Muhammad Panji Muslim] |
| Uncontrolled Keywords: | Transjakarta, route, algorithm, increase |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Fakultas Ilmu Komputer > Program Studi Informatika (S1) |
| Depositing User: | TITO CANDRA SEPTIO |
| Date Deposited: | 30 Sep 2024 03:25 |
| Last Modified: | 30 Sep 2024 03:25 |
| URI: | http://repository.upnvj.ac.id/id/eprint/31472 |
Actions (login required)
 |
View Item |