THE MOST LIKELY TRIP MATRIX ESTIMATED FROM TRAFFIC COUNTS

For a large number of applications conventional methods for estimating an origin destination matrix become too expensive to use. Two models, based on information minimisation and entropy maximisation principles, have been developed by the authors to estimate an o-d matrix from traffic counts. The models assume knowledge of the paths followed by the vehicles over the network. The models then use the traffic counts to estimate the most likely o-d matrix consistent with the link volumes available and any prior information about the trip matrix. Both models can be used to update and improve a previous o-d matrix. An algorithm to find a solution to the model is then described. The models have been tested with artificial data and performed reasonably well. Further research is being carried out to validate the models with real data. (Author/TRRL)

  • Availability:
  • Supplemental Notes:
    • Sponsored mainly by British Science Research Council.
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,   England 
  • Authors:
    • van Zuylen, Henk J
    • WILLUMSEN, L G
  • Publication Date: 1980-9

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00324809
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Report/Paper Numbers: HS-030 092
  • Files: HSL, ITRD, TRIS
  • Created Date: Sep 16 1983 12:00AM