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.