Time-varying shortest path problem with curfews
Liu Ning-zi · Journal of systems engineering · 2007
Shortest path problem is a basic problem in the combinatorial optimization.The objective in the network is time-varying.Moreover,there will be curfews in some nodes in the network.The paper develops the models for time-varying shortest path problem with soft and hard curfews and gives the algorithm for them.Then,the complexity of the algorithm is discussed.At last,a case is studied.