News

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.
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 ...
Unfortunately, prior research does not provide a clear direction for choosing an algorithm when one faces the problem of computing shortest paths on real road networks. Most of the computational ...