Dynamic route guidance with queue- and flow-dependent travel time

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 vehicles.

[1]  F. Webster.  TRAFFIC SIGNAL SETTINGS , 1958 .

[2]  EQUILIBRIUM ASSIGNMENT FOR FIXED TRAVEL DEMAND: AN INITIAL APPRAISAL OF ITS PRACTICAL UTILITY , 1976 .

[3]  Jean-Loup Farges,et al.  Route Guidance, Individual , 1991 .

[4]  M. I. Arsan,et al.  DEVELOPMENT AND SIMULATION TEST OF A DYNAMIC ROUTE GUIDANCE SYSTEM , 1992 .

[5]  David E. Boyce,et al.  The effect on equilibrium trip assignment of different link congestion functions , 1981 .

[6]  K B Davidson,et al.  THE THEORETICAL BASIS OF A FLOW-TRAVEL TIME RELATIONSHIP FOR USE IN TRANSPORTATION PLANNING , 1978 .

[7]  David Branston,et al.  LINK CAPACITY FUNCTIONS: A REVIEW , 1976 .

[8]  Mike McDonald,et al.  Modelling The Dynamics Of Route Guidance , 1992, The 3rd International Conference on Vehicle Navigation and Information Systems,.

[9]  R V Tomkewitsch.  ALI-SCOUT, A UNIVERSAL GUIDANCE AND INFORMATION SYSTEM FOR ROAD TRAFFIC , 1986 .

[10]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[11]  Jaume Barceló,et al.  SOFTWARE ENVIRONMENTS FOR INTEGRATED RTI SIMULATION SYSTEMS , 1991 .

[12]  P Bonsall,et al.  MEASURING BEHAVIOURAL RESPONSES TO ROAD TRANSPORT INFORMATICS , 1990 .

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  D. White.  Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions , 1993 .

[15]  D. L. Gerlough,et al.  Traffic flow theory : a monograph , 1975 .

[16]  Mike McDonald,et al.  MODELS AND STRATEGIES FOR DYNAMIC ROUTE GUIDANCE. PART A, THE MODELLING OF DYNAMIC ROUTE GUIDANCE , 1991 .

[17]  David E. Boyce,et al.  Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs , 1985, Transp. Sci..

[18]  J. J. Henry,et al.  Individual vs collective route guidance , 1993, Proceedings of VNIS '93 - Vehicle Navigation and Information Systems Conference.

[19]  N. Rouphail,et al.  Estimation of delays at traffic signals for variable demand conditions , 1993 .

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

[21]  Layne T. Watson,et al.  Computational experience with the Chow—Yorke algorithm , 1980, Math. Program..

[22]  R Akcelik.  A NEW LOOK AT DAVIDSON'S TRAVEL TIME FUNCTION , 1978 .

[23]  I. Catling,et al.  SOCRATES: System of cellular radio for traffic efficiency and safety , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[24]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[25]  G. Dantzig,et al.  Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .

[26]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .

[27]  Peter A. Steenbrink,et al.  Transport network optimization in the Dutch integral transportation study , 1974 .