An approach for time-varying shortest path problem with curfews
Wei Hang · Guanli kexue xuebao · 2009
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.Based on this condition,the algorithm was proposed.In order to decrease the objective value,the algorithm also considered the multi-departure-time and compared with the value in different departure times.The paper also discussed the complexity of the algorithm.At the end,a case was studied.