I will offer a new strategy for addressing the shortest path problem in two methods in this paper. For the shortest path issue in an uncertain environment, the first technique is the direct graph, and the second method is the indirect graph, and this method is compromised by the Fuzzy Dijkstra algorithm [10]. I'll start by giving a quick overview of fuzzy ant colony methods in general. Eventually, I'll discuss the benefits and drawbacks of employing fuzzy and ant colony algorithms to solve the shortest path problem, as well as my thoughts on the solutions' utility and the future of this field of computer science. The Dijkstra algorithm is a popular method for solving the shortest route problem (SPP). In this research, we use fuzzy ant colony techniques SPP in an uncertain environment and use the Fuzzy Dijkstra algorithm to compromise the output. One is figuring out how to add two edges together. The other problem is determining how to compare the distance between two pathways whose edge lengths are represented by fuzzy integers and fuzzy ant colony techniques. Two numerical examples of a transportation network are utilized to tackle these challenges and demonstrate the efficacy of the proposed strategy.