Aplikasi Sistem Informasi Geografis Penentuan Lintasan Terpendek Pengantaran Barang Menggunakan Algoritma A* (Studi Kasus pada CV. BKL Express untuk Wilayah Kota Medan)

Abstract

Deepening the user of expedition service it makes the expedition agent must give their best services. One of them is the fastness of conduction goods. But the couriers often have the trouble because there many alternative ways or it is because the address they do not know as well that they cannot consider the shortest path to conduction. This case bring up a conception about an application that able count and showing the shortest path. To count the shortest path it use the A* algorithm. The A* algorithm can determine the shortest path with optimizing process so the path that occur is the optimum path. This optimizing process is do with consider the heuristic function that will narrow the searching area. The heuristic function will be use for this application is Euclidian. It use Geographic Information System (SIG) to ease the couriers looking the shortest path that will selected. The result from this application is address order that will the couriers visit, and the shortest path among address base on map of Medan’s area.