Robust Routing and Cross-Entropy Estimation
最优化与控制
2016-08-16 v1
摘要
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.
引用
@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}
}
备注
19 pages