English

Robust Routing and Cross-Entropy Estimation

Optimization and Control 2016-08-16 v1

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.

Keywords

Cite

@article{arxiv.math/0509352,
  title  = {Robust Routing and Cross-Entropy Estimation},
  author = {Hélène Le Cadre},
  journal= {arXiv preprint arXiv:math/0509352},
  year   = {2016}
}

Comments

19 pages