An Algorithm for Robust Routing Strategies in Networks  

作　　者：Farida Manseur Nadir Farhi Habib Haj-Salem Jean Patrick-Lebacque 

机构地区：[1]University of Paris-Est, IFSTTAR/COSYS/GRETTIA, F-77447 Champs-sur Marne Cedex, France

出　　处：《Journal of Traffic and Transportation Engineering》2017年第1期8-20,共13页交通与运输工程（英文版）

摘　　要：In this article, the authors address the problem of optimal guidance of road network users. In the literature, several routing algorithms have been proposed under different approaches to solve this problem. Most adaptive algorithms for optimal path are based on the least expected travel time. Another approach has emerged named the SOTA （stochastic on time arrival）. This approach based on the idea of Frank （1969）, which aims to maximize the probability of arriving to a destination node parting from a given node in the network and with a given time budget. The authors＇ contribution consists here in extending this approach in order to introduce robustness towards path failure, in the guidance optimization. The authors propose a model that includes the existence as well as the performance of detours for selected paths, in the calculus of the travel time reliability. This new way of calculating travel time reliability guarantees a kind of robustness of the optimal guidance strategy.

关 键 词：Optimal guidance travel-time reliability ROBUSTNESS optimization traffic control. 

分 类 号：U[交通运输工程]