An Approach for Time-Varying Shortest Path Problem with Waiting
Wei Hang · Journal of systems management · 2008
Shortest path problem is a basic problem in the combinatorial optimization.The objective is time-varying.Moreover,it may reduce the cost with waiting in some nodes in the network.The paper gave the algorithm for the time-varying shortest path problem with waiting and with constrain of at most of total traverse time T.And then,the comlexity of the algorithm was discussed.At last,a case was studied.