| dc.contributor.advisor | Suwilo, Saib | |
| dc.contributor.advisor | Mawengkang, Herman | |
| dc.contributor.author | Sashanti, Rahayu | |
| dc.date.accessioned | 2022-11-01T02:03:31Z | |
| dc.date.available | 2022-11-01T02:03:31Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | https://repositori.usu.ac.id/handle/123456789/51615 | |
| dc.description.abstract | Transportation route planning problems determine from a transport mode can be
simplified by using network model, which can be represented by graph theory. This
important component of the transportation network planning is finding the shortest
path. In this thesis will learn how to find the model of a transportation network
planning using the shortest path with best path algorithm. This algorithm trying
to find the itinerary that requires the least number of transfers. It can be a model
of path network transportation with transfer. The used model was the model with
matrix. | en_US |
| dc.language.iso | id | en_US |
| dc.publisher | Universitas Sumatera Utara | en_US |
| dc.subject | Transportasi Publik | en_US |
| dc.subject | Lintasan terpendek | en_US |
| dc.subject | Algoritma best-path planning | en_US |
| dc.title | Model Perencanaan Jaringan Transportasi dengan Adanya Transfer | en_US |
| dc.type | Thesis | en_US |
| dc.identifier.nim | NIM137021029 | |
| dc.identifier.nidn | NIDN0009016402 | |
| dc.identifier.nidn | NIDN8859540017 | |
| dc.identifier.kodeprodi | KODEPRODI44101#Matematika | |
| dc.description.pages | 38 Halaman | en_US |
| dc.description.type | Tesis Magister | en_US |
