| Article ID: | iaor20071433 |
| Country: | China |
| Volume: | 25 |
| Issue: | 10 |
| Start Page Number: | 108 |
| End Page Number: | 113 |
| Publication Date: | Oct 2005 |
| Journal: | Systems Engineering Theory & Practice |
| Authors: | Xu Yinfeng, Su Bing |
The online Canadian Traveler Problem is considered for the case when the traveler meets some unexpected accident or a series of unexpected accidents during the travel process. From the online point of view, the waiting strategy and the greedy strategy are proposed and the competitive ratios of the two strategies are given based on the assumption that each blockage recovery time is uniformly distributed, and the performances of these two strategies are analyzed and compared.