Muhammad Reza Adi Pratama, . (2026) PROTOTYPE DUAL-PREFERENCE ROUTE OPTIMIZATION TRANSJAKARTA BERBASIS GTFS DENGAN ALGORITMA DIJKSTRA DAN FRAMEWORK LARAVEL. Skripsi thesis, Universitas Pembangunan Nasional Veteran Jakarta.
![[img]](http://repository.upnvj.ac.id/style/images/fileicons/text.png) |
Text
ABSTRAK.pdf Download (375kB) |
|
Text
AWAL.pdf Download (4MB) |
|
Text
BAB I.pdf Restricted to Repository UPNVJ Only Download (2MB) |
|
Text
BAB II.pdf Restricted to Repository UPNVJ Only Download (7MB) |
|
Text
BAB III.pdf Restricted to Repository UPNVJ Only Download (9MB) |
|
Text
BAB IV.pdf Restricted to Repository UPNVJ Only Download (30MB) |
|
Text
BAB V.pdf Download (1MB) |
|
Text
DAFTAR PUSTAKA.pdf Download (1MB) |
|
Text
DAFTAR RIWAYAT HIDUP.pdf Restricted to Repository staff only Download (135kB) |
|
Text
LAMPIRAN.pdf Restricted to Repository UPNVJ Only Download (4MB) |
|
Text
HASIL PLAGIARISME.pdf Restricted to Repository staff only Download (61MB) |
|
Text
ARTIKEL KI.pdf Restricted to Repository staff only Download (1MB) |
Abstract
Traffic congestion in Jakarta remains a major Problem. Although Transjakarta operates 243 corridors with 8,650 stops, an integrated Route search system is still limited. This research aims to build a Transjakarta Route search prototipe based on GTFS data using Dijkstra's algorithm in two modes namely shortest distance and minimum transfer priority. The method uses system engineering with GTFS and POI data collection, Python/QGIS data Cleaning, Laravel 12 implementation, and Black Box Testing with Python verification. The results show the system successfully integrates 243 corridors, 8,650 stops, and 32,000 POI, with GTFS validation reducing errors from 47 to 0 and warnings by 96%. Dijkstra in two modes achieves average execution times of 1,200–1,450 ms, consistent with O((V + E) log V) complexity. Independent verification demonstrates that the system yields identical transfer counts compared to manual calculation in complex scenarios, with a maximum distance deviation of only 2.2%. Black Box Testing on 13 functions and 16 APIs achieved 100% success. In conclusion, this prototipe is accurate, efficient, and feasible for Transjakarta travel planning with two search preferences.
| Item Type: | Thesis (Skripsi) |
|---|---|
| Additional Information: | [No.Panggil: 2210511080] [Pembimbing 1: Jayanta] [Pembimbing 2: Neny Rosmawarni] [Penguji 1: Noor Falih] [Penguji 2: Muhammad Panji Muslim] |
| Uncontrolled Keywords: | Transjakarta, GTFS, Dijkstra Algorithm, Laravel, Route Search |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Fakultas Ilmu Komputer > Program Studi Informatika (S1) |
| Depositing User: | MUHAMMAD REZA ADI PRATAMA |
| Date Deposited: | 02 Sep 2026 08:19 |
| Last Modified: | 02 Sep 2026 08:19 |
| URI: | http://repository.upnvj.ac.id/id/eprint/51945 |
Actions (login required)
 |
View Item |