Travelling time on dense networks.

Auteur(s)
Halpern, J.
Jaar
Samenvatting

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.

Publicatie aanvragen

5 + 0 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
B 7638 (In: B 5309) /71/72/
Uitgave

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.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.