Recommending Public Transit Route: Ant-Colony Optimization or Dijkstra?

Advances in algorithmic studies have been made recently, especially in the area of finding the shortest path. Despite taking a greedy approach, the Dijkstra algorithm is well recognized for its efficacy and has established itself as the industry standard for identifying the shortest path in a graph. Conversely, scientists have embraced the Ant-Colony Optimization (ACO) approach, which draws inspiration from the behavior of ants. This study examines the two methods and determines if, given equivalent resources, ACO can generate Dijkstra-like recommendations. Research data is subjected to both algorithms, and the outcomes are presented visually. In data measurement, Dijkstra is processed first to determine the best path, and then the ACO method is applied to produce findings that are similar to Dijkstra. In data measurement, Dijkstra is processed first to determine the best path, and then the ACO method is applied to produce findings that are similar to Dijkstra. Memory consumption, computation time, initial memory allocation, and final memory allocation are evaluation parameters. ACO is more efficient than Dijkstra in terms of execution time and number of pathways traversed, according to the study's repeated evaluation methodology. This iterative assessment procedure is carried out to address the possibility of single measurements resulting from the JavaScript Garbage Collector. The study's findings imply that a larger memory may be necessary for ACO to deliver the desired outcomes. These results could also be impacted by each algorithm's distinct qualities.