Model Perencanaan Jaringan Transportasi dengan Adanya Transfer

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.