Abstract: This paper studies the vehicle scheduling problem of minimization of the transportation risks varied with time,taking into account the case of the cost constraints and allowing for waiting at the nodes of the network. That is, an integrated risk-based path-selection problem together with the determination of the departure and waiting time each node on the selected path in the time-dependent networks. After a mixed integer programming model is proposed,a novel algorithm is given. The computational complexity of the algorithm is also analyzed. Finally,a numerical example is presented to show the effectiveness and feasibility of this algorithm.

Key words: vehicle scheduling problem, transportation network, risk, algorithm