model perencanaan jaringan tranportasi dengan adanya transfer

rahayu sashanti

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.

Keyword: Public transportation, Shortest path, Best path algorithm.

 


Full Text:

PDF

References


Bast,H., Carlsson, E., Eigenwillig, A., Geisberger, R., Harrelson, C., Raychev, V., dan Viger, F., (2010). Fast Routing in Very Large Public Transportation Net-works Using Transfer Patterns. ESA’10 paper due to space limitations, Volume6346 of LNCS, pages 290-301, Springer.

Bast, H., Sternisko,J., dan Storandt, S., (2013). Delay-Robustness of Transfer Patterns in Public Transportation Route Planning. 13th Workshop on Al-gorithm Approaches for Transportation Modelling Optimization and Systems (ATMOS’13, pages 42-54.

Geisberger, R., (2011). Advanced Route Planning in Transportation Networks. PhD Thesis. Karlsruhe Instituts fur Technologie.Germany

Hsiao, Y.T., Chuang, C.L., dan Chien,C.C., (2004). Ant Colony Optimization forBest Path Planning. International Symposium on Communications and Infor-mation Technologies, Sapporo, Japan.

Liu, C. L. (2002). Best Path Planning for Public Transportation System. The 5thInternational IEEE Conference on Intelligent Transportation Systems, 834-839.

Liu, C.L., Pai, T.W., Chang,C.T., dan Hsieh, C.M., (2001). Path Planning Al-gorithms for Public Transportation System. The Fourth International IEEEConference on Intelligent Transportation Systems , Oakland, California, USA.




DOI: https://doi.org/10.36294/jmp.v3i2.500

Refbacks

  • There are currently no refbacks.