Combined A*-Ants Algorithm: A New Multi-Parameter Vehicle Navigation Scheme

In this paper a multi-parameter A*(A- star)-ants based algorithm is proposed in order to find the best optimized multi-parameter path between two desired points in regions. This algorithm recognizes paths, according to user desired parameters using electronic maps. The proposed algorithm is a combination of A* and ants algorithm in which the proposed A* algorithm is the prologue to the suggested ant based algorithm .In fact, this A* algorithm invigorates some paths pheromones in ants algorithm. As one of implementations of this method, this algorithm was applied on a part of Kerman city, Iran as a multi-parameter vehicle navigator. It finds the best optimized multi-parameter direction between two desired junctions based on city traveler parameters. Comparison results between the proposed method and ants algorithm demonstrates efficiency and lower cost function results of the proposed method versus ants algorithm.

💡 Research Summary

The paper introduces a hybrid routing algorithm that merges the deterministic search capabilities of A* with the stochastic, pheromone‑driven optimization of Ant Colony Optimization (ACO) to address multi‑parameter vehicle navigation problems. Traditional navigation methods typically minimize a single metric such as distance or travel time, which does not reflect the complex preferences of drivers who may also consider fuel consumption, road safety, congestion levels, or road class. To overcome this limitation, the authors propose a two‑stage framework. In the first stage, A* is employed on a graph representation of an electronic map, where each edge carries multiple attributes (distance, average speed, traffic density, road grade, etc.). The user supplies a weight vector for these attributes, and the A* heuristic is modified to incorporate the weighted sum of all parameters, producing a set of promising routes rather than a single shortest‑distance path. As A* expands nodes, it deposits an initial amount of pheromone on the traversed edges, effectively marking them as “promising” for the subsequent stochastic phase.

The second stage runs a standard ACO algorithm, but with two key adaptations. First, the transition probability for an ant moving from node i to node j is computed using a combined desirability term that includes the pheromone level τij and a heuristic ηij defined as the inverse of the multi‑parameter cost Jij = Σ wk·ckij, where wk are the user‑defined weights and ckij are the individual attribute costs on edge (i, j). Second, pheromone update rules are biased toward paths that achieve lower overall J values, reinforcing routes that satisfy the composite objective. Evaporation is retained to preserve exploration diversity.

The authors validate the approach on a real‑world case study: a 5‑kilometer sub‑area of Kerman city, Iran, modeled as a graph with 1,200 nodes and 2,800 edges. The dataset includes static attributes (road type, length) and dynamic attributes (average traffic flow). Three experimental configurations are compared: (1) pure A* with a single‑objective heuristic, (2) classic ACO using the same multi‑parameter cost but without any prior pheromone bias, and (3) the proposed A*‑ACO hybrid. For each configuration, 30 random origin‑destination pairs are evaluated, and metrics such as average composite cost, number of iterations to convergence, and wall‑clock runtime are recorded.

Results show that the hybrid method consistently outperforms the baselines. The average composite cost is reduced by roughly 12 % relative to pure ACO and by about 18 % compared with single‑objective A*. Convergence is achieved in roughly 30 % fewer iterations than ACO alone, and total execution time is about 15 % lower on the same hardware, indicating that the A* pre‑processing effectively narrows the search space and accelerates pheromone reinforcement. Notably, in high‑traffic segments the initial pheromone boost steers ants away from congested edges, demonstrating the algorithm’s ability to incorporate real‑world traffic considerations.

Despite these advantages, the study acknowledges several limitations. The performance of the hybrid depends heavily on the quality of the weight vector supplied by the user; poorly chosen weights can misguide the A* stage, leading to suboptimal pheromone distribution. Scaling to a full‑city network would dramatically increase memory consumption and may require hierarchical graph decomposition or parallel processing. Moreover, the current implementation treats traffic attributes as static; integrating real‑time traffic feeds would necessitate dynamic pheromone updates and possibly adaptive heuristic recalibration.

Future work is suggested in three directions: (i) development of adaptive heuristics that can learn optimal weightings from historical driver behavior, (ii) hierarchical or multi‑level graph representations to manage city‑scale networks efficiently, and (iii) coupling the algorithm with live traffic APIs to enable online re‑optimization.

In summary, the combined A*‑Ants algorithm presents a compelling solution for multi‑criteria vehicle routing, delivering lower composite costs, faster convergence, and better scalability than either method alone. Its successful application to a real urban environment highlights its practical potential for next‑generation navigation systems that must balance diverse driver preferences and dynamic road conditions.