Start to End: Recommended Travel Routes Based on Tourist Preference
Vivien H. Wangi, Jap Tji Beng, Wasino Wasino
Abstract
Abstract When going on a tour, one of the things to consider is making an itinerary before traveling in accordance to the time limit required by tourists. This application will help tourists plan a tour that suits them. In making this system, Greedy Algorithm is used to help optimizing process of searching the shortest travel time and to find the number of tourism site in the route chosen for the tourists. Tourism site points for start to end can also be determined and specified by tourists. The data used was gathered directly through observations in Yogyakarta, specifically Bantul and Sleman. The result is an application for guiding or routing tourism objects from one object to another from start to end and in between. These travel routes are shown through google maps with other information such as distance and travel time from one tourist attraction to other tourist attractions.