Travel Time Prediction-Based Routing Algorithms for Automated Highway Systems

This study investigates routing algorithms for automated highway systems (AHS). In AHS, the central system manages decisions regarding routing for all vehicles and the distribution of traffic volume. We define an automated highway routing problem, of which the objective is to minimize the average travel time of vehicles through the target highway network. We propose four routing approaches considering (1) distance, (2) current traffic conditions, (3) predicted travel time, and (4) probabilistic route selection with predicted travel time. In the third and fourth approaches, the predicted travel time is obtained from an empirical speed-density relationship. AnyLogic, an agent-based simulation software, is used to simulate the behavior of individual cars. Four approaches are tested on a sample highway network and we found that the routing approach considering the predicted travel time difference exhibits the best performance.

Abstract licence: CC BY-NC-ND

24 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.