Untitled Document
Untitled Document
Home >> Volume >> Daftar Isi >> Detail
Untitled Document

VOLUME 1 Edisi 2 , Nopember 2016




Title

SIMULASI RUTE TERPENDEK LOKASI PARIWISATA DI NIAS DENGAN METODE BREADTH FIRST SEARCH DAN TABU SEARCH

Authors
Delima Zai, Haeni Budiati, Sunneng Sandino Berutu
Teknik Informatika, Fakultas Sains dan Komputer, Universitas Kristen Immanuel

Abstract

The ability of the method of Breadth First Search conducting a broad search by visiting on a node or point then visit all the points neighbors to find a solution, while Tabu Search is an algorithm that guide each stage in order to produce an objective function optimum, Algorithm Breadth First search can be combined with Tabu search algorithm to obtain the optimal shortest path based on the distance, by the way when Breadth First search find a solution then do not immediately stop, but continue to search to find the shortest path by using the principle of Tabu. Research that make a application search short path area toursm in Nias island besed web with algorithmBreadth First Searchdan Tabu Search. Breadth First Search is algorithm for search short path, this algorithm doing search be widen with visit from one point to another point so visit all point neighbor for find solution. After doing modifkasi on Breadth First Search Algorithm and Tabu Search, the two methods can be implemented in the shortest route simulation tourist locations on the island to find the shortest path tourist spots, where gas stations, where restaurants, hotels, and government offices.
Keywords

Algorithm Breadth First,Tabu Searchalgorithms, short path, travelling
File

Download Artikel
Untitled Document JOURNAL CONTENT
Search :


LINKS FREE JOURNALS


Untitled Document