IMPLEMENTASI ALGORITMA HILL CLIMBING PADA PENENTUAN JARAK TERPENDEK KOTA WISATA DI INDONESIA

  • Fitriati D
  • Nessrayasa N
N/ACitations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

Searching and determining the shortest route is a complex problem, looking for the shortest route from a number of attractions and the distance between attractions. With varying access paths, the shortest route search becomes the right choice using a website-based app that provides the closest route on a map using the SAHC (Steepest Ascent Hill Climbing) algorithm. Steepest Ascent Hill Climbing is a method of an algorithm that is widely used for optimization problems. One application is to find the shortest route by maximizing or minimizing the value of the existing optimization function. In research ii study using 34 provinces in Indonesia and every province, there are 5 most popular tour, accuracy value obtained in research determination of the shortest distance of tourist city in Indonesia is 93,3%.

Cite

CITATION STYLE

APA

Fitriati, D., & Nessrayasa, N. M. (2019). IMPLEMENTASI ALGORITMA HILL CLIMBING PADA PENENTUAN JARAK TERPENDEK KOTA WISATA DI INDONESIA. Jurnal Riset Informatika, 1(3), 127–132. https://doi.org/10.34288/jri.v1i3.35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free