The Shortest Time Paths Problem with Curfews
Shi Bing · Dali Xueyuan xuebao · 2006
Shortest path problem is a basic problem in the combinatorial optimization.the objective is time varying.Moreover,there will be curfews in some nodes in the network.the paper developed the models for time-varying shortest time path problem with soft and hard curfews and the algorithm for them.At last,a case was studied.