In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

Among these, shortest path queries are instrumental in identifying the most efficient routes within a network, thereby reducing cost, time and resource consumption.

Shuijian Zhang, Xuejun Liu, Meizhen Wang, A Novel Ant Colony Optimization Algorithm For The Shortest-path Problem In Traffic Networks, Filomat, Vol. 32, No. 5 (2018), pp. 1619-1628 ...

Furthermore, they provided a comparison of their algorithm with the existing static APSP algorithms in the MPC model and demonstrate its effectiveness. DOI: 10.1007/s11704-024-3452-2 ...

This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a ...

Classic math conundrum solved: Superb algorithm for finding the shortest route Date: March 12, 2021 Source: University of Copenhagen - Faculty of Science Summary: One of the most classic ...