| Article ID: | iaor2006576 |
| Country: | China |
| Volume: | 22 |
| Issue: | 8 |
| Start Page Number: | 10 |
| End Page Number: | 13 |
| Publication Date: | Aug 2004 |
| Journal: | Systems Engineering |
| Authors: | Xu Yinfeng, Su Bing |
| Keywords: | programming: travelling salesman |
The online Recoverable Canadian Traveler Problem is considered for the case when the blocked edges occur one by one without any predictable information except its recover time. From the online point of view, the waiting strategy and the moving strategy are proposed and the competitive ratios of the two strategies are given based on a continuous network, and we analyze and compare the performance of two strategies.