Optimasi Jalur Tercepat dengan Menggunakan Modifikasi Algoritma Bellman Ford (Studi Kasus Lintas Antar Kecamatan Kota Malang)
DOI:
https://doi.org/10.21776/jeeccis.v9i2.400Abstract
Abstract— In the study application of the calculation method of modification of Bellman Ford is aiming to find the fastest path between districts in the city of Malang . Bellman method calculates all the paths of the place of origin of the place of destination with the help of GPS . Testing Bellman Ford modify their direct and produce Comparing these same route as much as 2 % of a modified Bellman Ford is best after the modified . Bellman was also good enough to be used as the calculation of the level of road width , road conditions , vehicle ramp and volume. The conclusion that can be drawn is the use of application design Bellman appropriate or suitable partner in the search for the fastest track in the city of Malang.Keywords : Line fastest , Bellman Ford , GPSReferences
Muhammad Imam Suwatno., aplikasi pencarian rute penerbangan terpendek dengan menggunakan algoritma dijkstra pada PT dwidaya indoex change.
Natalia N., Kajian Dampak Pengembangan Pembangunan Kota Malang Terhadap Kemacetan Lalu Lintas (studi pada Pembangunan Kota Malang)
Fenny Anggraini.,Penerapan Metode algoritma bellman ford dalam aplikasi pencarian lokasi perseroan terbatas di PT.Jakarta Industrial Estate
pulogadung (PT.Jiep)
Zakaria., Terapan Konsep Graph dalam penyusunan Jadwal Perkuliahan di Jurusan Pendidikan Matamatika F. MIPA UNG.