OPTIMAL LOCATION OF TRAFFIC COUNTING POINTS FOR TRANSPORT NETWORK CONTROL

An iterative two-stage procedure is proposed that first derives the complete traffic flow vector on a transport network and then produces a reliable estimate of the Origin/Destination (O/D) trip matrix. The procedure is based on the measured flows provided by a minimal-cost set of traffic sensors. These are located on the network by solving a suitable combinatorial optimization model through a number of heuristics that achieve good performances. It is shown that solving the sensor location problem may significantly improve the accuracy of common O/D estimation procedures.

  • Availability:
  • Corporate Authors:

    Elsevier

    The Boulevard, Langford Lane
    Kidlington, Oxford  United Kingdom  OX5 1GB
  • Authors:
    • BIANCO, L
    • Confessore, G
    • Reverberi, P
  • Conference:
  • Publication Date: 1997

Language

  • English

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 853-858

Subject/Index Terms

Filing Info

  • Accession Number: 00767579
  • Record Type: Publication
  • ISBN: 0080429319
  • Report/Paper Numbers: Volume 2
  • Files: TRIS
  • Created Date: Aug 12 1999 12:00AM