This paper presents an algorithm with movement prohibitions which eliminates some problems encountered in network representation used for traffic assignment models, and further allows the representation of the network to be simplified. The paper first presents an appraisal of some proposed methods and reviews the basic concept of existing shortest-route algorithms. The problem of obtaining shortest routes in networks with movement prohibitions is formulated and an algorithm presented. The computational procedure is illustrated by means of a numerical example. The computational efficiency of the algorithm is tested and the test results show that the algorithm is very efficient. (Author/TRRL)

  • Availability:
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,    
  • Authors:
    • Easa, S M
  • Publication Date: 1985-6

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00451970
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Report/Paper Numbers: HS-039 181
  • Files: ITRD, TRIS
  • Created Date: May 31 1986 12:00AM