Article ID: | iaor200971235 |
Country: | Netherlands |
Volume: | 18 |
Issue: | 2 |
Start Page Number: | 195 |
End Page Number: | 205 |
Publication Date: | Aug 2009 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Xu Yinfeng, Su Bing, Hu Maolin, Zhu Binhai, Zhu Zhijun |
Keywords: | networks: path |
From the online point of view, we study the Canadian Traveller Problem (CTP), in which the traveller knows in advance the structure of the graph and the costs of all edges. However, some edges may fail and the traveller only observes that upon reaching an adjacent vertex of the blocked edge. The goal is to find the least-cost route from the source