Robust Routing and Cross-Entropy Estimation
H\'el\`ene Le Cadre

TL;DR
This paper introduces a new method combining shortest path routing and Cross-Entropy stochastic optimization to dynamically estimate traffic on origin-destination pairs.
Contribution
It presents a novel approach integrating routing algorithms with Cross-Entropy for improved traffic estimation.
Findings
Effective dynamic traffic estimation demonstrated
Combines shortest path routing with Cross-Entropy optimization
Adapts filtering algorithms for real-time traffic monitoring
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Target Tracking and Data Fusion in Sensor Networks · Blind Source Separation Techniques
