Shortest path algorithms form the backbone of network optimisation, providing solutions for the minimum‐cost routes between nodes in a graph. Classical approaches such as Dijkstra’s algorithm and the ...

The heuristic function \(\eta_{ij} \left( t \right)\) was calculated based on the distance and angle from the current node to the target node. It makes path search more directional. A pheromone ...