Online shortest paths with confidence intervals for routing in a time varying random network

05/22/2018
by   Stéphane Chrétien, et al.
0

The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach. Our improvement enables to find a confidence interval for the shortest path, by using the stochastic gradient algorithm for approximate Bayesian inference.

READ FULL TEXT
research
05/03/2019

Breaking the Bellman-Ford Shortest-Path Bound

In this paper we give a single-source shortest-path algorithm that break...
research
12/03/2020

Multi-Path Routing on the Jellyfish Networks

The Jellyfish network has recently be proposed as an alternate to the fa...
research
11/20/2018

Effect of correlation on the traffic capacity of Time Varying Communication Network

The network topology and the routing strategy are major factors to affec...
research
07/13/2023

Automatic Routing System for Intelligent Warehouses

Automation of logistic processes is essential to improve productivity an...
research
08/09/2022

A Novel Faster All-Pair Shortest Path Algorithm Based on the Matrix Multiplication for GPUs

The shortest path problem is a class of typical problems in graph theory...
research
05/11/2019

A New Shortest Path Algorithm Generalized on Dynamic Graph for Commercial Intelligent Navigation for Transportation Management

Dynamic graph research is an essential subject in Computer Science. The ...
research
03/22/2022

An Online Learning Approach to Shortest Path and Backpressure Routing in Wireless Networks

We consider the adaptive routing problem in multihop wireless networks. ...

Please sign up or login with your details

Forgot password? Click here to reset