Abstract
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 O to the destination D, more precisely, to find an adaptive strategy minimizing the competitive ratio, which compares the performance of this strategy with that of a hypothetical offline algorithm that knows the entire topology in advance. In this paper, we present two adaptive strategies—a greedy or myopic strategy and a comparison strategy combining the greedy strategy and the reposition strategy in which the traveller backtracks to the source every time when he/she sees a failed edge. We prove tight competitive ratios of 2k+1−1 and 2k+1 respectively for the two strategies, where k is the number of failed edges in the graph. Finally, we propose an explanation of why the greedy strategy and the comparison strategy are usually preferred by drivers in an urban traffic environment, based on an argument related to the length of the second-shortest path in a grid graph.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Papadimitriou CH, Yannakakis M (1991) Shortest paths without a map. Theor Comput Sci 84(1):127–150
Bar-Noy A, Schieber B (1991) The Canadian traveller problem. In: Proceedings of the second annual ACM-SIAM symposium on discrete algorithms, pp 261–270
Westphal S (2008) A note on the k-Canadian traveler problem. Inf Process Lett 106(3):87–89
Zhu Z, Xu Y, Liu C (2003) Scheduling for on-line routing problem and its competitive strategy analysis. J Syst Eng 18(4):261–270. (In Chinese)
Hu M (2005) Comparison Strategy and its competitive ratio analysis of scheduling for on-line routing. J Ningxia Univ 26(3):207–210. (In Chinese)
Takimoto E, Warmuth M (2003) Path kernels and multiplicative updates. J Mach Learn Res 4(5):773–818
Kalai A, Vempala S (2005) Efficient algorithms for online decision problems. J Comput Syst Sci 71:291–307
Blum A, Even-Dar E, Ligett K (2006) Routing without regret: on convergence to Nash equilibria of regret minimizing algorithms in routing games. In: Proceedings of the 25th annual ACM symposium on principles distributed computing, pp 45–52
Sleator D, Tarjan R (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202–208
Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
Fiat A, Rabani Y, Ravid Y (1998) Competitive k-server algorithms. In: Proceedings of the 22nd IEEE symposium on foundation of computer science, pp 454–463
Fiat A, Woeginger GJ (1998) Online algorithms: The state of art. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Additional information
We would like to acknowledge the support from NSF of China (No. 70525004, No. 70121001 and No. 60736027), and the support from K.C. Wong Education Foundation, Hong Kong.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Xu, Y., Hu, M., Su, B. et al. The canadian traveller problem and its competitive analysis. J Comb Optim 18, 195–205 (2009). https://doi.org/10.1007/s10878-008-9156-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9156-y