ANALISIS PERPANJANGAN POLIS ASURANSI JP-ASTOR (ASURANSI KENDARAAN BERMOTOR) MENGGUNAKAN ALGORITMA C4.5 PADA PT. JASARAHARJA PUTERA CABANG PALEMBANG

NAZALA, ARDHY and WEDHASMARA, Ari (2015) ANALISIS PERPANJANGAN POLIS ASURANSI JP-ASTOR (ASURANSI KENDARAAN BERMOTOR) MENGGUNAKAN ALGORITMA C4.5 PADA PT. JASARAHARJA PUTERA CABANG PALEMBANG. Undergraduate thesis, Sriwijaya University.

	Text RAMA_57201_09101003040.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (2MB) | Request a copy
Preview	Text RAMA_57201_09101003040_0011127803_01_front_ref.pdf Available under License Creative Commons Public Domain Dedication. Download (382kB) | Preview
	Text RAMA_57201_09101003040_0011127803_02.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (993kB) | Request a copy
	Text RAMA_57201_09101003040_0011127803_03.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (485kB) | Request a copy
	Text RAMA_57201_09101003040_0011127803_04.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (513kB) | Request a copy
	Text RAMA_57201_09101003040_0011127803_05.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (488kB) | Request a copy
	Text RAMA_57201_09101003040_0011127803_06.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_57201_09101003040_0011127803_07.pdf Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (126kB) | 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:	Data Mining, Algoritma C4.5, Java, RUP
Subjects:	T Technology > T Technology (General) > T58.6-58.62 Management information systems > T58.62 Decision support systems Cf. HD30.213 Industrial management
Divisions:	09-Faculty of Computer Science > 57201-Information Systems (S1)
Depositing User:	Mr Halim Sobri
Date Deposited:	07 Jan 2021 02:25
Last Modified:	11 Jan 2021 07:59
URI:	http://repository.unsri.ac.id/id/eprint/39382

Actions (login required)

View Item