Show simple item record

dc.contributor.advisorAgmalaro, Muhammad Asyhar
dc.contributor.advisorNisa, Karlina Khiyarin
dc.contributor.authorAditama, Rendy
dc.date.accessioned2015-01-09T07:22:46Z
dc.date.available2015-01-09T07:22:46Z
dc.date.issued2014
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/73317
dc.description.abstractFinding shortest path is a method to maximize time efficiency to travel from one place to another. A good location is a place with minimum path from locations where it is accessed. A good location is considered to be potential for public facility, housing complex, etc. In this research, graph theory is used to solve the problem of deciding location with minimum path from accessing locations. Mapping of a region is represented as a graph with location points and accessing locations as nodes and variation paths as arcs. The next step is finding the shortest path for every location candidate nodes from accessing nodes using Dijkstra algorithm. This research resulted in a web based aplication that presents a territory map and a user can choose where the location candidates and accessing locations are. The user will be shown the best location out of location candidates.en
dc.language.isoid
dc.subject.ddcBogor-Jawa Baraten
dc.subject.ddc2013en
dc.subject.ddcComputer Scienceen
dc.subject.ddcAlgorithsen
dc.titlePenentuan Lokasi Ideal Berdasarkan Total Jarak Tempuh Terpendek dari Berbagai Lokasi Menggunakan Algoritme Dijkstraen
dc.subject.keywordBogor Agricultural University (IPB)en
dc.subject.keywordshortest pathen
dc.subject.keywordregion mappingen
dc.subject.keywordgraphen
dc.subject.keywordDijkstra algorithmen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record