Enhancing Inverse Ant Algorithm using Path Elimination Rules

Abstract

Shortest Path Problem is one of the problems addressed in graph theory. One of the examples is the Travelling Sales Person which finds the shortest path from source to destination. Because it is a NP-complete problem, it uses brute force in finding the optimal solution. However, the solution was prone to stagnation since optimal solution is easy to reach its limits when applied to real-world scenarios. A solution was derived through the enhancement of the ant algorithm which is the inverse ant algorithm where an alternate route is provided in case a limit is reached. However, the selection process of path of the inverse ant algorithm increases time complexity. Path selection process is addressed through the enhancement of ant algorithm using the path elimination rule. This process of enhancing is applied to the inverse ant algorithm to enhance its performance.