Abstract
This study investigates a generalization of the Canadian Traveller Problem (CTP), which finds real applications in dynamic navigation systems used to avoid traffic congestion. Given a road network G = (V,E) in which there is a source s and a destination t in V, every edge e in E is associated with two possible distances: original d(e) and jam d + (e). A traveller only finds out which one of the two distances of an edge upon reaching an end vertex incident to the edge. The objective is to derive an adaptive strategy for travelling from s to t so that the competitive ratio, which compares the distance traversed with that of the static s,t-shortest path in hindsight, is minimized. This problem was defined by Papadimitriou and Yannakakis. They proved that it is PSPACE-complete to obtain an algorithm with a bounded competitive ratio. In this paper, we propose tight lower bounds of the problem when the number of “traffic jams” is a given constant k; and we introduce a simple deterministic algorithm with a min { r, 2k + 1}-ratio, which meets the proposed lower bound, where r is the worst-case performance ratio. We also consider the uniform jam cost model, i.e., for every edge e, d + (e) = d(e) + c, for a constant c. Finally, we discuss an extension to the metric Travelling Salesman Problem (TSP) and propose a touring strategy within an \(O(\sqrt{k})\)-competitive ratio.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proc. of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 261–270 (1991)
Ben-David, S., Borodin, A.: A new measure for the study of online algorithms. Algorithmica 11(1), 73–91 (1994)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge Univeristy Press, Cambridge (1998)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Techical report, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)
Chuzhoy, J.: Routing in undirected graphs with constant congestion. In: Proc. of the 44th ACM Symposium on Theory of Computing, STOC (2012)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Huang, Y., Liao, C.S.: The Canadian traveller problem revisited (2012) (manuscripts), http://acolab.ie.nthu.edu.tw/draft/ctp.pdf
Karger, D., Nikolova, E.: Exact algorithms for the Canadian traveller problem on paths and trees. Technical report, MIT Computer Science & Artificial Intelligence Lab (2008), http://hdl.handle.net/1721.1/40093
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84(1), 127–150 (1991)
Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)
Su, B., Xu, Y.F.: Online recoverable Canadian traveller problem. In: Proc. of the International Conference on Management Science and Engineering, pp. 633–639 (2004)
Su, B., Xu, Y., Xiao, P., Tian, L.: A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 417–426. Springer, Heidelberg (2008)
Westphal, S.: A note on the k-Canadian traveller problem. Information Processing Letters 106, 87–89 (2008)
Xu, Y.F., Hu, M.L., Su, B., Zhu, B.H., Zhu, Z.J.: The Canadian traveller problem and its competitive analysis. Journal of Combinatorial Optimization 18, 195–205 (2009)
Zhang, H., Xu, Y.: The k-Canadian Travelers Problem with Communication. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 17–28. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, Y., Liao, CS. (2012). The Canadian Traveller Problem Revisited. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)