Journal of Information Systems Engineering and Business Intelligence
Abstract
Hotel search was an important thingfor travelers in their traveling journey. Travelers would consider criteria such as class, price and review of the hotel.Beside those things, distance between Hotel and tourist attractionswasalsoimportant factor to be considered. In this research, system was constructed to perform a hotels search by shortest travelling route using Greedy Algorithm. This research was conducted through four stages, the first stage wasdata and information collectingof tourist attraction and hotel. Second stagewasdata analysis with greedy algorithm in purpose to classify the data and implementing greedy algorithm with manual calculation to the problem research. The third stage was the development of the system, and the last stage wasevaluating the system with the experts who are experienced in the field of tourism and the prospective user of this application. Results from this study was the system can provide recommendations and sequence the shortest journey between the hotel and tourist attraction based on the greedy algorithm.Keywords— Hotel, Tourist Attraction, Greedy Algorithm, Travelling Salesman Problem
SISTEM PENCARIAN HOTEL BERDASARKAN RUTE PERJALANAN TERPENDEK DENGAN MEMPERTIMBANGKAN DAYA TARIK WISATA MENGGUNAKAN ALGORITMA GREEDY.pdf
SISTEM PENCARIAN HOTEL BERDASARKAN RUTE PERJALANAN TERPENDEK DENGAN MEMPERTIMBANGKAN DAYA TARIK WISATA MENGGUNAKAN ALGORITMA GREEDY.ppt
