Computer running times of some BPR programs as related to network size.

Author(s)
Jansen, G.R.M. & Bovy, P.H.L.
Year
Abstract

Formulae are established for estimating computer running costs of traffic assignment operations as a function of network size. Separate relationships are given each of the following basic operations: building a network data file, searching minimum paths, and loading trips to minimum paths.

Request publication

7 + 3 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
B 5577 /71/72/
Source

Delft, Technical University, Institute for Town Planning Research, 1973, 13 p., fig., tab., ref.; Memorandum No. RAV/2/73.17

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.