Open AccessIMPLEMENTASI ALGORITMA HILL CLIMBING PADA PENENTUAN JARAK TERPENDEK KOTA WISATA DI INDONESIA
Author(s) -
Desti Fitriati,
Nura Meutia Nessrayasa
Publication year - 2019
Publication title -
jurnal riset informatika
Language(s) - English
Resource type - Journals
eISSN - 2656-1743
pISSN - 2656-1735
DOI - 10.34288/jri.v1i3.35
Subject(s) - climbing , hill climbing , computer science , value (mathematics) , mathematical optimization , mathematics , geography , algorithm , machine learning , archaeology
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%.