Proactive route guidance to avoid congestion

We propose a proactive route guidance approach that integrates a system perspective: minimizing congestion, and a user perspective: minimizing travel inconvenience. The approach assigns paths to users so as to minimize congestion while not increasing their travel inconvenience too much. A maximum level of travel inconvenience is ensured and a certain level of fairness is maintained by limiting the set of considered paths for each Origin-Destination pair to those whose relative difference with respect to the shortest (least-duration) path, called travel inconvenience, is below a given threshold. The approach hierarchically minimizes the maximum arc utilization and the weighted average experienced travel inconvenience. Minimizing the maximum arc utilization in the network, i.e., the ratio of the number of vehicles entering an arc per time unit and the maximum number of vehicles per time unit at which vehicles can enter the arc and experience no slowdown due to congestion effects, is a system-oriented objective, while minimizing the weighted average experienced travel inconvenience, i.e., the average travel inconvenience over all eligible paths weighted by the number of vehicles per time unit that traverse the path, is a user-oriented objective. By design, to ensure computational efficiency, the approach only solves linear programming models. In a computational study using benchmark instances reflecting a road infrastructure encountered in many cities, we analyze, for different levels of maximum travel inconvenience and, the minimum maximum arc utilization and the weighted average experienced travel inconvenience. We find that accepting relatively small levels of maximum travel inconvenience can result in a significant reduction, or avoiding, of congestion.

[1]  D. Hearn,et al.  Network Equilibrium and Pricing , 2003 .

[2]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[3]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[4]  Hani S. Mahmassani,et al.  Network performance under system optimal and user equilibrium dynamic assignments: Implications for , 1993 .

[5]  Markos Papageorgiou,et al.  Dynamic modeling, assignment, and route guidance in traffic networks , 1990 .

[6]  Shirish S. Joshi,et al.  A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems , 2001, Transp. Sci..

[7]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[8]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  Yang Wen,et al.  A dynamic traffic assignment model for highly congested urban networks , 2012 .

[10]  Moshe Ben-Akiva,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1985 .

[11]  J. Tanchoco,et al.  Optimal flow path design of unidirectional AGV systems , 1990 .

[12]  George L. Nemhauser,et al.  Congestion-aware dynamic routing in automated material handling systems , 2014, Comput. Ind. Eng..

[13]  Sascha Ossowski,et al.  Route guidance: Bridging system and user optimization in traffic assignment , 2015, Neurocomputing.

[14]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[15]  Rolf H. Möhring,et al.  System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion , 2022 .