Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Fitro, Achmad and Suryono, Suryono and Kusumaningrum, Retno (2018) Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm. In: Proceeding 2018 5th International Conference on Electrical Engineering, Computer Science and Informatics (EECSI 2018), 16-18 October 2018, Ijen Suites Resort & Convention Malang, Indonesia.

Text FIX-PROCEEDING.pdf Download (96MB)

Abstract

Abstract— Online transportation has become a basic
requirement of the general public in support of all activities to go
to work, school or vacation to the sights. Public transportation
services compete to provide the best service so that consumers
feel comfortable using the services offered, so that all activities
are noticed, one of them is the search for the shortest route in
picking the buyer or delivering to the destination. Node
Combination method can minimize memory usage and this
methode is more optimal when compared to A* and Ant Colony
in the shortest route search like Dijkstra algorithm, but can’t
store the history node that has been passed. Therefore, using
node combination algorithm is very good in searching the
shortest distance is not the shortest route. This paper is
structured to modify the node combination algorithm to solve the
problem of finding the shortest route at the dynamic location
obtained from the transport fleet by displaying the nodes that
have the shortest distance and will be implemented in the
geographic information system in the form of map to facilitate
the use of the system.
Keywords— Shortest Path, Algorithm Dijkstra, Node
Combination, Dynamic Location (key words)

Actions (login required)

View Item