Loading...
Please wait, while we are loading the content...
Similar Documents
Perbandingan Algoritma Brute-Force dan Algoritma A* Untuk Mencari Rute Terpendek Antar Klinik Kecantikan di Kota Medan
| Content Provider | Semantic Scholar |
|---|---|
| Author | Wulandari, Syindy |
| Copyright Year | 2017 |
| Abstract | Public enthusiasm for beauty clinic is particularly high in Medan city. Beauty Clinic serves the appropriate complaints and treatment for consumers , including consultation skin problems, treatment, etc Many options can be taken to get to the location of the nearest desired Beauty Clinic,but there’s a condition when the Beauty Clinic on the go is not open or closed. The Data of distance and the route to the location Are desirable taken from Google maps, with the number of nodes about 10 and it will be implemented into a graph . To solving a graf problem it also need algorithms, in this case A* algorithm, and Brute Force algorithm are used to solve the searching shortest path problem, Based on the results the nearby Beauty Clinic that found using the A* algorithm and Brute Force algorithm produces the same total distance but with a different running times which is the A* algorithm is faster than brute force algorithm. However Brute-Force produces the optimum distance while the A* is optimum. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://repository.usu.ac.id/bitstream/handle/123456789/65670/Cover.pdf?isAllowed=y&sequence=7 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
