Traffic control using graph theory

  • Riedel T
  • Brunner U
  • 7


    Mendeley users who have this article in their library.
  • 7


    Citations of this article.


In this paper the design of a controller crossing is presented by means of an example. The controller to be developed has to minimise the waiting time of the public transportation while maintaining the individual traffic flowing as well as possible. First, the model of the chosen traffic crossing is derived. Then, using a combination of 'Dynamic Programming' and 'Branch and Bound' the control algorithm is presented. A visualization of the algorithm is given by means of graphs, complexity issues are investigated, and computational refinements proposed. Simulation results are shown at the end. The actual implementation of the control algorithm for the example shown is under way and carried out in co-operation with the Transportation Authority of the city of Zurich. The work presented here is part of a bigger project. The overall goal is to provide the traffic engineer with a tool for designing 'intelligent' controllers for traffic lights. © 1994.

Author-supplied keywords

  • Discrete Event Systems
  • Dynamic Programming
  • graph theory
  • traffic control

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Th Riedel

  • U. Brunner

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free