Show simple item record

dc.contributor.advisorTulus, Tulus
dc.contributor.advisorIryanto, Iryanto
dc.contributor.authorMunar, Munar
dc.date.accessioned2022-11-01T02:32:10Z
dc.date.available2022-11-01T02:32:10Z
dc.date.issued2013
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/51644
dc.description.abstractDetermination of the shortest routes of land transportation is very needed by the general public. These are places where vehicles do towards the end of the beginning. Someone determine the initial places where it is located and where the end (where it was going) based graph-based maps, the shortest route from start point to end point was determined using Hill Climbing algorithm, so that the results (output) form the shortest route to the> destination can be found. Shortest route calculation using Hill Climbing Algorithms and Applications using Visual Studio 2005en_US
dc.language.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectAlgoritma Hill Climbingen_US
dc.subjectRute Terpendeken_US
dc.subjectVisual Studio 2005en_US
dc.titlePenentuan Rute Terpendek antar Kabupaten dalam Provinsi Aceh Menggunakan Algoritma Hill Climbingen_US
dc.typeThesisen_US
dc.identifier.nimNIM117038023
dc.identifier.nidnNIDN0001096202
dc.identifier.kodeprodiKODEPRODI55101#TeknikInformatika
dc.description.pages55 Halamanen_US
dc.description.typeTesis Magisteren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record