ESTIMATION OF TURNING FLOWS AT AN INTERSECTION FROM TRAFFIC COUNTS

This report describes the principle of information minimization as a method for estimating turning flows at an intersection from the entry/exit flows at each approach. Two algorithms are described. The first algorithm is for the case when all approach entry/exit flows are available. The second algorithm is suitable for those situations when information on entry/exit flows are incomplete. This second algorithm is particularly useful for generating a complete set of turning flows from traffic counts retrievable from the control system SCATS. The algorithms are implemented in FORTRAN77 and are available freely as pilot versions in 1989 to those interested in experimenting with their own data. Examples are described in this report to illustrate how the programs can be employed for turning flow estimation at a single intersection, and at a paired or compound intersection. The results indicate that a convergent solution obtained from the information minimization algorithms may not be a correct solution in those cases when a priori or prior information is inadequate.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/0869103431
• Corporate Authors:

  ARRB

  Melbourne, Victoria  Australia 
• Authors:
  • Luk, JYK
• Publication Date: 1989

Media Info

• Serial:
  • Issue Number: 4

Subject/Index Terms

• TRT Terms: Algorithms; Intersections; Traffic control; Traffic counts; Turning traffic
• Geographic Terms: Australia
• Old TRIS Terms: Traffic control systems; Turning flow
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00495221
• Record Type: Publication
• ISBN: 0 86910 343 1
• Files: TRIS
• Created Date: Jul 31 1990 12:00AM