About AURA - Advanced Unified Routing Algorithms: A modern ES package providing graph shortest-path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall) with benchmarks and tests.

Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include ...

In this paper, a comprehensive comparative evaluation of routing protocols based totally on global Telecommunication Union-Telecommunication (ITU-T) requirements and IEEE standards for vehicular delay ...

It combines techniques from Bellman-Ford, a slower algorithm and Dijkstra’s to improve runtime. It minimizies reliance on priority queue sorting by processing multiple nodes (the “frontier”) at once ...

In this paper, we address an interesting variant of the vehicle routing problem with time windows (VRPTW) faced by the China National Petroleum Corporation (CNPC). The CNPC owns a limited number of ...