Determination of the Shortest Route Towards the Tourist Destination Area Using the Ant Algorithma

Abstract

There are so many tourism objects in the world, especially in Indonesia. One of the most famous tourist attractions in Indonesia including Bali, Borobudur, Lake Toba, and many others. The tourist attraction is not only famous in Indonesia but also famous to foreign countries, because one of them is a relic of the wonders of the world. In addition, these tourist attractions also have natural beauty and uniqueness, which is different from other countries, so that it attracts local tourists and foreign tourists to visit the place. However, there are several routes to get to these tourist attractions, so that local tourists and foreign tourists who want to visit have a little trouble having to go through which route to get to their destination. Surely they want the closest travel route. Therefore the purpose of this study is to use the ant algorithm to determine the shortest route to the tourist area. The ant algorithm is adopted based on the behavior and habits of the ant colony. In general, ant colonies can find and find the fastest and shortest route or route to food sources from their nests, based on footprints on traversed trails. This study uses 5 cities for example, including C1, C2, C3, C4 and C5, with the starting point of C1 and C5 destination point. Based on calculations using the ant algorithm to determine the shortest route, the shortest and fastest route obtained by ant 4 is route C1 → C4 → C5 with a distance of 140 KM.