PERBANDINGAN ALGORITMA FLOYD WARSHALL DAN ALGORITMA A* DALAM PENCARIAN RUTE TERPENDEK MENUJU LOKASI RUMAH SAKIT DI PALEMBANG

HUTAGALUNG, TOGI MARTUA and PRIMARTHA, RIFKIE and SAZAKI, Yoppy (2016) PERBANDINGAN ALGORITMA FLOYD WARSHALL DAN ALGORITMA A* DALAM PENCARIAN RUTE TERPENDEK MENUJU LOKASI RUMAH SAKIT DI PALEMBANG. Undergraduate thesis, Sriwijaya University.

	Text RAMA_ 55201_09111002052.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (19MB) | Request a copy
Preview	Text RAMA_ 55201_09111002052_0001067709_0006067406_01_front_ref.pdf Available under License Creative Commons Public Domain Dedication. Download (14MB) | Preview
	Text RAMA_ 55201_09111002052_0001067709_0006067406_02.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (713kB) | Request a copy
	Text RAMA_ 55201_09111002052_0001067709_0006067406_03.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (2MB) | Request a copy
	Text RAMA_ 55201_09111002052_0001067709_0006067406_04.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_ 55201_09111002052_0001067709_0006067406_05.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (124kB) | Request a copy
Preview	Text RAMA_ 55201_09111002052_0001067709_0006067406_06_ref.pdf Download (127kB) | Preview
	Text RAMA_ 55201_09111002052_0001067709_0006067406_07_lamp.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (556kB) | Request a copy

Abstract

The issue of the shortest route search optimization is often encountered in everyday life. This issue can be resolved properly and efficiently using specific algorithms. This research was conducted to compare processing time of Floyd Warshall algorithm and A* algorithm to find the shortest route to Palembang general hospitals. Name and location of destination hospitals obtained with help of google maps. Based on analysis of the algorithms concluded that the value of asimptotik time complexity A* algorithm is O(n) that is smaller than Floyd Warshall algorithm with complexity value O(n^3) so the result show A* algorithm is faster. It is proven from the result of search time by utilizing software where search time route to the hospital using the A* algorithm with average time 0.039385 second is faster than Floyd Warshall algorithm with average time 0.079425 second. The software from this research result is expected later can help providing solution to find shortest route to hospitals in Palembang

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Shortest Route Search, Floyd Warshall, A*, Google Maps
Subjects:	T Technology > T Technology (General) > T58.5-58.64 Information technology > T58.5 General works Management information systems Cf. HD30.213 Industrial management Cf. HF5549.5.C6+ Communication in personnel management Cf. TS158.6 Automatic data collection systems (Production control)
Divisions:	09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User:	Mr Halim Sobri
Date Deposited:	07 Jan 2021 02:49
Last Modified:	11 Jan 2021 08:01
URI:	http://repository.unsri.ac.id/id/eprint/39384

Actions (login required)

View Item