Article
Version 1
Preserved in Portico This version is not peer-reviewed
Non-Aggressive Adaptive Routing in Traffic
Version 1
: Received: 11 May 2023 / Approved: 15 May 2023 / Online: 15 May 2023 (04:33:40 CEST)
A peer-reviewed article of this Preprint also exists.
Prasad, M.N.; Dimitrov, N.; Nikolova, E. Non-Aggressive Adaptive Routing in Traffic. Mathematics 2023, 11, 3639. Prasad, M.N.; Dimitrov, N.; Nikolova, E. Non-Aggressive Adaptive Routing in Traffic. Mathematics 2023, 11, 3639.
Abstract
Routing a person through a traffic network presents a tension between selecting a fixed route that is easy to navigate and selecting an aggressively adaptive route that minimizes the expected travel time. We propose to create non-aggressive adaptive routes in the middle-ground seeking the best of both these extremes. Specifically, these routes still adapt to changing traffic conditions, however we limit the number of adjustments made in the route. This improves the user experience, by providing a continuum of options between saving travel time and minimizing navigation. We design strategies to model single and multiple route adjustments, and investigate enumerative techniques to solve these models. To alleviate the intractability with handling real-life traffic data, we develop efficient algorithms with easily computable lower and upper bounds. We finally present computational experiments highlighting the benefits of limited adaptability in terms of reducing the expected travel time.
Keywords
Adaptive routing; dyamic programming; shortest paths; acyclic directed graphs
Subject
Engineering, Industrial and Manufacturing Engineering
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
