The Canadian Traveler Problem

The Canadian Traveler Problem and its variations are considered. Devising a travel strategy under the condition that each site is associated with a recovery time l(x,x) to reopen any blocked road that is adjacent to it is the main problem of this paper. The quality of online algorithm is usually measured based on two alternate criteria: competitive ratio and worst case performance. In the worst case performance analysis, the paper devised an algorithm to get the optimal worst case travel time and the algorithm complexity is considered. Greedy Strategy is put forward in the competitive analysis and k+22 is proved to be the competitive ratio.