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.

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 ...

An algorithm is presented to identify noninferior solutions to the MSPP. This algorithm incorporates a K shortest path algorithm. The algorithm is demonstrated with a sample problem and the results ...