Shortest path problem is a basic problem in the combinatorial optimization.In dynamic transportation networks,the arc travel times and costs are time-varying depending on road condition,weather and traffic condition.Moreover,there will be curfews in some nodes in the network because of resting,congestion and so on.The paper developed models for time-varying shortest path problems with both soft and hard curfews.Then,the optimal condition for getting the shortest path with curfews was proved.Base...