Berekening van N-e kortste paden in een wegennetwerk.

Author(s)
Jaarsma, C.F. & Koppe, W.
Year
Abstract

For the determination of minimum paths in a road network the authors have looked for the most efficient algorithm. This work has been part of the building of a traffic model for rural areas. The algorithm chosen was that by Dijkstra. Apart from the minimum path also the 'next best' has to be determined and that is why an algorithm was chosen which produces the N-e path as a longer alternative for the shortest n-1 path which was originally calculated.

Request publication

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

Publication

Library number
B 18247 T /71/ IRRD 253886
Source

Verkeerskunde, Vol. 32 (1981), No. 2 (februari), p. 71-73, 2 fig., 3 tab., 8 ref.

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.