SHORTEST ROUTE ALGORITHM WITH MOVEMENT PROHIBITIONS

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:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Corporate Authors:

  Pergamon Press, Incorporated

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

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 197-208
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 19B
  • Issue Number: 3
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Algorithms; Economic efficiency; Itinerary; Legislation; Mathematical models; Motion; Networks; Roads; Route choice; Traffic assignment
• Uncontrolled Terms: Efficiency; Prohibitions; Road networks
• ITRD Terms: 5911: Efficiency; 699: Itinerary; 6473: Mathematical model; 5483: Movement; 1525: Prohibition; 1053: Road network; 679: Traffic assignment
• Subject Areas: Economics; Highways; Law; Operations and Traffic Management;

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