Travelling time on dense networks.

Author(s)
Halpern, J.
Year
Abstract

The earlier arrival time and the minimum travelling time from source to destination are not, in general, the same. In fact they are different for a wide class of networks. The case where some edges are closed for travelling during specific periods of time is discussed. An algorithm for the solution of the minimal travelling problem is presented. With a minor change this algorithm also solves the earliest arrival problem.

Request publication

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

Publication

Library number
B 7638 (In: B 5309) /71/72/
Source

In: Proceedings of the Second IFAC/-IFIP/IFORS Symposium on Traffic Control and Transportation Systems, North-Holland, Amsterdam, Netherlands, 1974, p. 665-675, 2 fig., 2 tab., 5 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.