SHORTEST ROUTES THROUGH A ROAD NETWORK

This report defines the shortest route problem and discusses the approach to this problem in general terms; this discussion is illustrated by an example. Technical details are given of the algorithm used in the method selected. This method, documented in a paper by Murchland, JD entitled: "The once through" method of finding all shortest distances in a graph from a simple origin, has the property that, for any mode as origin, each connected mode is processed once and only once and each link is utilized no more than once. The main assumption of the method as it has been implemented in this report is that no link has a negative weight. Details are also given of the program which consists of a main program and five subroutines written in FORTRAN 4. For abstract of technical note a9, see IRRD abstract no 211930. /TRRL/

  • Corporate Authors:

    Ship and Boat International

    Department of Architecture, 16 Brooklands Avenue
    London EC1A 9BY,   England 
  • Authors:
    • Stoneman, C A
  • Publication Date: 1972-11

Media Info

  • Features: Figures; References;
  • Pagination: 30 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00098088
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Report/Paper Numbers: Tech. Note
  • Files: ITRD, TRIS
  • Created Date: Oct 18 1975 12:00AM