Ant Colony System Based Ant Adaptive For Search of the Fastest Route of Tourism Object Jember, East Java

Abstract

The fastest route search is a problem to find routes having a relatively small or empty number of congestion or density so that the required travel time is faster to get to a location. One of them is the route to the tourist attraction in Jember regency, East Java has many relatively solid lines. Some researchers have done a lot of research on finding the shortest path using Ant Colony System (ACS) method. However, the ACS method has a weakness, where more ants pass through a path, the clearer the footprint but the volume of ants passing through the path is also longer. Therefore in this research use ant adaptive on ACS method to find the fastest path to the tourist location in Jember Regency. Due to the increasing number of densities, it takes longer to get to the food source. In this study, ant adaptive for ACS method is used to determine the optimal number of ants in searching for the fastest path to the tourist attraction in Jember District, East Java. Various trials are done to prevent the search process of resolving the already traced solution space to find the fastest path. The fastest path does not have to have the shortest path but has the fastest time with the paths having relatively little or no density at all. The results showed that ant adaptive for ACS method developed in this research is able to find the optimal number of ants in determining the fastest paths to the tourist object so that the search result of the fastest route of tourist attraction in Jember Regency in accordance with the reality of the passable path and has a density relatively small or almost nonexistent. The success rate was conducted on 8 tourist objects in Jember with 98 paths tested using road data in Jember regency, East Java with the fastest path solution influenced by the closer to the optimum distance, the more number of ants influenced.