Application of ant colony optimization algorithm to determine optimal value in choosing tourist attractions in Bangkalan – Madura

• Main Authors: Rachmad, Aeri, Syarif, Muhammad, Rochman, Eka Mala Sari
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithms; Ant colony optimization; Footprints; Optimization algorithms; Route selection; Shortest-path problems; Tourism; Tourist attractions; Traveling salesman problem
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0111287

The impact of COVID-19 leaves a deep sadness, especially in the tourism sector. Many tourist places are not open to prevent the transmission of this virus. Madura is one of the islands located in the province of East Java which has many tourist attractions. Bangkalan is one of the districts in Madura which has 21 tourism spots. There are many tourist attractions scattered in Bangkalan district, but there is a problem arisen in determining the shortest path to get to these tourist attractions. There are several route options available in each area. Optimal value search can be used to obtain the highest and lowest values of a problem. One of the popular problems that can be solved by optimization algorithms is the Traveling Salesman Problem (TSP) to determine the closest route using the Ant Colony Optimization algorithm. The ant algorithm is an algorithm adopted from the behaviour of the ant colony. An ant colony can find the shortest route between the nest and a food source based on footprints on the trajectory it has traversed. The more ants that pass through a track, the clearer the footprints will be. Ant Colony algorithm is very appropriate to be applied in solving optimization problems, one of which is to determine the shortest path. The final result of this discussion is the algorithm used is able to determine the shortest path to find tourist destinations as an alternative route. The accuracy results obtained are 100% with a rho value of 0.5, an alpha value of 1, and a beta value of 1.