This paper presents an algorithm for finding all shortest routes from all nodes to a given destination in N-node general networks (in which the distances of arcs can be negative).

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...