COMPUTER RUNNING TIMES OF SOME BPR PROGRAMS AS RELATED TO NETWORK SIZE

Formulae are established for estimating computer running costs of traffic assignment operations as a function of network size. Separate relations are given for each of the following basic operations: building a network data file, searching minimum paths, and loading trips to minimum paths. The spectifications of the formulae are derived from the working of the computer programs. The few incidental figures available on realised computer times are used to calibrate the relations. The formulae are only applicable to BPR-Programs and IBM 360/65 machines. /TRRL/

  • Corporate Authors:

    Delft University of Technology

    Stevinweg 1
    Delft,   Netherlands  2600 GA
  • Authors:
    • Jansen, G
    • Bovy, P
  • Publication Date: 1973-9

Media Info

  • Features: Figures; References; Tables;
  • Pagination: 14 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00126105
  • Record Type: Publication
  • Source Agency: Institute for Road Safety Research, SWOV
  • Report/Paper Numbers: R&D Rept.
  • Files: ITRD, TRIS
  • Created Date: Apr 7 1976 12:00AM