PERANCANGAN GEOGRAPHIC INFORMATION SYSTEM UNTUK TRACKING DAN ROUTING MENGGUNAKAN ALGORITMA DIJKSTRA PADA KENDARAAN ANGKUTAN UMUM

Authors

  • Muh. Aristo Indrajaya

DOI:

https://doi.org/10.54757/fs.v9i2.61

Keywords:

GPS, GIS, GSM, Dijkstra, TCP / IP

Abstract

The ability to do tracking and routing of a motorized vehicle is very useful in everyday life, such as security on private vehicles, public transportation systems, mass transportation fleet management and others. In this study, we designed a Geographic Information System (GIS) application that will be applied to public transport services. This system will in real time track the position of each vehicle (taxi) and be able to perform automatic service for every taxi request by the customer.

Dijkstra's algorithm is a graph search algorithm that solves the shortest path problem that originates from one node for a graph where the weight of the node must not be negative. The analysis is done by examining the node with the smallest weight and inserting it into the set of solutions with the initial search for the origin node requiring knowledge of all paths and weights. Dijkstra's algorithm which is applied to this system will function to find the most suitable taxi for customers by using distance parameters and traffic density levels as the weight value.

Downloads

Published

2019-10-01

How to Cite

[1]
M. A. . Indrajaya, “PERANCANGAN GEOGRAPHIC INFORMATION SYSTEM UNTUK TRACKING DAN ROUTING MENGGUNAKAN ALGORITMA DIJKSTRA PADA KENDARAAN ANGKUTAN UMUM”, Fs, vol. 9, no. 2, Oct. 2019.

Issue

Section

Articles

Most read articles by the same author(s)