Ant-inspired metaheuristic algorithms, such as Ant Colony Optimization (ACO), are dependable for addressing intricate problems in discrete and continuous domains. This study examines the influence of the pheromone significance factor (α), heuristic importance factor (β), and pheromone decay rate (ρ) on the effectiveness of ACO for path-searching. We analyze the algorithm's convergence rate and effectiveness in identifying the shortest path by simulating various parameter configurations on a standard graph. The value α= 2 was chosen based on prior research on the behavior of real ants. Our simulations demonstrated that α= 2 is a superior choice to α= 1, which the naïve approach would recommend. The experiments demonstrated that setting β to 1 and ρ to 10% resulted in the optimal convergence speed and the minor average path lengths. Also, by examining the effect of the number of ants on the convergence of the simulation, it was found that the selection of more ants shows more paths. Using more ants for the initial stop leads to a marginal decrease in the average path length.