SISTEM INFORMASI GEOGRAFIS PENCARIAN JALUR TERPENDEK TEMPAT PENGINAPAN DI SURABAYA MENGGUNAKAN ALGORITMA DIJKSTRA

Linda Rimala Dewi, Budi Dwi Satoto

Abstract


On business or vacation travelling to outside city, it's need to take a rest for a while.
Aim of this purpose travelling is begining from departure places that it's need to know
shortest and fastest path that belong to correct way to the destination places. To
determine this shortest path, user have to know the route to reach any place from map.
Although Surabaya is one of the big city, this city devide into five region and 31 district
that define in Google map, Geographic Information system with shortest path find
destination place such rest place, Lodging house in this city is become recommend for
this new traveller. Dijkstra algorithm used to find shortest path very helpfully to solve
traveller problem although worst condition such as weather problem, missing path and
direction or etc. This application support with web base application that can be surf
from Handheld phone that very simple to used. This SIG with google map also expected
to help new traveller getting shortest path similar with his speed of driving.

Keywords


SIG, Dijkstra algorithm, Google map

Refbacks

  • There are currently no refbacks.