Robust Routing and Cross-Entropy Estimation

Hélène Le Cadre · arXiv (Cornell University) · 2005

In the following article, we present a novel way to etimate the amounts of traffic on the Origin-Destination couples (OD couples). This new approach combines together a routing algorithm based on the principle of the shortest path and a recent technique of stochastic optimization called Cross-Entropy. In a final part, we adapt a particular filtering algorithm in order to be able to dynamically estimate the evolution of the traffic on the OD couples.

Read the paper · More papers on PaperTik