Journal ArticleDOI
Dynamic route guidance with queue- and flow-dependent travel time
Reads0
Chats0
TLDR
An optimal guidance algorithm is presented that takes into account the driver compliance to route advice and flows higher than capacities of links and shows that for most of the demands, the guidance benefit increases with the ratio of equipped vehicles.Abstract:
This paper presents an optimal guidance algorithm that takes into account the driver compliance to route advice and flows higher than capacities of links The optimization problem consists in minimizing the travel time of guided vehicles using a model that describes the traffic by a set of flows on a graph The travel time of a link is obtained by computing the delay of vehicles due to queues It leads to Wardrop's travel time when the initial queue is empty and the flow is smaller than the capacity of the link The optimization problem is solved using the Simplex Algorithm recursively on two examples Results show that for most of the demands, the guidance benefit increases with the ratio of equipped vehiclesread more
Citations
More filters
Journal ArticleDOI
Traveler Compliance with Advice: A Bayesian Utilitarian Perspective
TL;DR: In this article, a formal model of traveler compliance with different types of advice (or guidance, prescriptive information) based on the premises of Bayesian expected utility decision-making is presented.
Proceedings ArticleDOI
Travel time estimation in urban road networks
J. Anderson,M. Bell +1 more
TL;DR: In this paper, the authors developed two methods for the estimation of link travel times at signalised junctions under traffic responsive control, and evaluated them with data from a registration plate survey in a SCOOT region in Nottingham.
Journal Article
A probabilistic multipath traffic assignment model which obviates path enumeration. in: the automobile
TL;DR: In this article, a probabilistic assignment model that attempts to circumvent path enumeration is presented, which assigns trips to all reasonable paths simultaneously, in such a way that the resulting effect is identical to what would have been obtained if each path had been assigned trips separately under certain choice probability assumptions.
Journal ArticleDOI
Hybrid Vehicle-Centric Route Guidance
Jennifer Farver,Ismail Chabini +1 more
TL;DR: In this article, the authors present a vehicle-centric route guidance system in which the vehicle senses, transmits and receives network data, and acts as a computer and consumer of guidance, and a hybrid structure is proposed in which guidance is computed in a predictive, centralized layer and revised in a decentralized, vehicle-level layer taking into account real-time, local data.
Journal ArticleDOI
Fusion de données pour l'estimation des temps de parcours via la théorie de l'évidence
TL;DR: In this article, Dempster et Shafer propose a method for the estimation of the timeseries of parcours, based on the theory of l'evidence of evidence.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Traffic signal settings
TL;DR: In this article, the authors present an approach to evaluate the number of delays at a signal-to-interception intersection and propose a formulae to calculate the average delay per vehicle.
Journal ArticleDOI
A probabilistic multipath traffic assignment model which obviates path enumeration
TL;DR: A probabilistic assignment model that attempts to circumvent path enumeration, in such a way that the resulting effect is identical to what would have been obtained if each path had been assigned trips separately under certain choice probability assumptions.