The purpose of this paper is to describe the dual graph technique developed by the authors to represent transport networks. The method is intended to simplify the coding of complex transport networks to a considerable degree, particularly when there are turning restrictions, or when multiple transfers between modes or transit lines must be taken into account. The first section presents the traditional form in which transport networks are analytically represented, and describes the main problems that are confronted. The second section describes the dual graph technique in general terms, and shows how the network code remains simple, even if prohibited turns are introduced, completely avoiding fictitious links and the possibility of errors. The third section describes the way in which dual networks are constructed in formal terms. In the fourth section, the method is extended to represent transit routes or, in general, multiple operators and modes. The final section draws the main conclusions and points out that dual graphs can be very useful for detailed traffic models.

  • Availability:
  • Corporate Authors:


    The Boulevard, Langford Lane
    Kidlington, Oxford  United Kingdom  OX5 1GB
  • Authors:
    • Anez, J
    • de la Barra, T
    • PEREZ, B
  • Publication Date: 1996-6


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00723225
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Jul 1 1996 12:00AM