Log In Sign Up

Collective Shortest Paths for Minimizing Congestion on Temporal Load-Aware Road Networks

by   Chris Conlan, et al.

Shortest path queries over graphs are usually considered as isolated tasks, where the goal is to return the shortest path for each individual query. In practice, however, such queries are typically part of a system (e.g., a road network) and their execution dynamically affects other queries and network parameters, such as the loads on edges, which in turn affects the shortest paths. We study the problem of collectively processing shortest path queries, where the objective is to optimize a collective objective, such as minimizing the overall cost. We define a temporal load-aware network that dynamically tracks expected loads while satisfying the desirable `first in, first out' property. We develop temporal load-aware extensions of widely used shortest path algorithms, and a scalable collective routing solution that seeks to reduce system-wide congestion through dynamic path reassignment. Experiments illustrate that our collective approach to this NP-hard problem achieves improvements in a variety of performance measures, such as, i) reducing average travel times by up to 63 iii) distributing load across up to 97 proposed approach is generalizable, which allows it to be adapted for other concurrent query processing tasks over networks.


page 1

page 2

page 3

page 4


Finding k-Dissimilar Paths with Minimum Collective Length

Shortest path computation is a fundamental problem in road networks. How...

Scalability of Network Visualisation from a Cognitive Load Perspective

Node-link diagrams are widely used to visualise networks. However, even ...

Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks

Computing shortest paths is a fundamental operation in processing graph ...

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

The problem of identifying the k-shortest paths (KSPs for short) in a dy...

Multi-Constraint Shortest Path using Forest Hop Labeling

The Multi-Constraint Shortest Path (MCSP) problem aims to find the short...

Risk-Averse Equilibrium for Autonomous Vehicles in Stochastic Congestion Games

The fast-growing market of autonomous vehicles, unmanned aerial vehicles...

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks

Finding the shortest paths in road network is an important query in our ...