Pencarian SPBU Terdekat dan Penentuan Jarak Terpendek Menggunakan Algoritma DIJKSTRA (Studi Kasus di Kabupaten Jember)

  • Retnani W
  • Istiadi D
  • Roqib A
N/ACitations
Citations of this article
107Readers
Mendeley users who have this article in their library.

Abstract

Fuel Filling Station (Gas Station) to the public is an infrastructure provided by PT Pertamina. This infrastructure is quite important in all cities, one of which is Jember. Access to information and facilities layout stations in this district is still very difficult to obtain. This study discusses the mapping of the location, location, and the determination of the shortest path to reach the location of the gas station. Search nearby gas stations in this study using the Djiktra’s algorthm . The results of the data collection obtained 33 gas stations that sell gasoline and bio- diesel in Jember . The shortest path location is dependent on criteria , cost, and reverse _cost. To identification of one way by providing high value to reverse _cost parameter of 1000000 , so this road will never be selected. Dijkstra’s algorithm is very suitable and easy to use on a case study in this research. Implementation of dijkstra’s algorithm has recommended the shortest path in order to provide fuel efficiency of motor vehicles.

Cite

CITATION STYLE

APA

Retnani, W. E. Y., Istiadi, D., & Roqib, A. (2015). Pencarian SPBU Terdekat dan Penentuan Jarak Terpendek Menggunakan Algoritma DIJKSTRA (Studi Kasus di Kabupaten Jember). JURNAL NASIONAL TEKNIK ELEKTRO, 4(1), 89. https://doi.org/10.25077/jnte.v4n1.132.2015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free