INDAH PUTRI RAMADHAN, INDAH (2023) SISTEM INFORMASI PENCARIAN JARAK TERDEKAT DENGAN COST TERENDAH DENGAN METODE GREEDY BEST FIRST SEARCH. Skripsi thesis, IIB DARMAJAYA.
![[img]](http://repo.darmajaya.ac.id/style/images/fileicons/text.png) |
Text
ABSTRAK ING.pdf Download (497kB) |
|
Text
BAB 1.pdf Download (310kB) |
|
Text
BAB 2.pdf Download (1MB) |
|
Text
BAB 3.pdf Download (793kB) |
|
Text
BAB 4.pdf Download (1MB) |
|
Text
BAB 5.pdf Download (304kB) |
|
Text
COVER.pdf Download (261kB) |
|
Text
DAFTAR GAMBAR.pdf Download (205kB) |
|
Text
DAFTAR ISI.pdf Download (311kB) |
|
Text
DAFTAR PUSTAKA.pdf Download (206kB) |
|
Text
DAFTAR TABEL.pdf Download (204kB) |
|
Text
PENGESAHAN.pdf Download (1MB) |
|
Text
PERNYATAAN.pdf Download (630kB) |
|
Text
PERSEMBAHAN.pdf Download (204kB) |
|
Text
PERSETUJUAN.pdf Download (1MB) |
|
Text
RIWAYAT HIDUP.pdf Download (557kB) |
Abstract
Shortest route search when performing a search for distribution places is frequent thing conducted besides find city purpose. Reason search route shortest is summarizing travel and save on travel cots. For that we need a system that can search the location of the destination object in detail and accurately based on the user’s location or position. Apart from the system will built with Technology GIS (Geographich Information system) for complete problem search distance closest. Algorithm BeFS use score heuristic on each the knots. The heuristic value in this study is the estimated value of the distance between the two point. The node with the best huristic value will be opened or worked on first. Heuristic value is said to be the best if the value is close to the true value. It is assumed that in the shortest route search problem, the value is considered good if the value gives the result is smaller than the other values because the context discussed is distance. Based on the results of the discussion that has been carried out, it can be concluded that the manufacture search information system for the shortest distance with the lowest cost with the greedy best method first search which worthy for give convenience to user for look for showroom location without having to spend money in searching showrooms wihtinggive route fastest way going to showrooms. And users could specify in area where showrooms which will visited and could take into account distance which wanted. Say Key : System, Distance closest, cost lowest, Greedy Best First Search
| Item Type: | Thesis (Skripsi) |
|---|---|
| Subjects: | Ilmu Komputer eSkripsi |
| Divisions: | Skripsi/TA & PKPM/KP - Fakultas Ilmu Komputer > Sistem Informasi |
| Depositing User: | indah indah Indah Putri Ramadhan |
| Date Deposited: | 11 Jul 2023 08:59 |
| Last Modified: | 11 Jul 2023 08:59 |
| URI: | http://repo.darmajaya.ac.id/id/eprint/12213 |
Actions (login required)
 |
View Item |