Abstract
In this article, we present new results on the online multi-agent O–D k-Canadian Traveler Problem, in which there are multiple agents and an input graph with a given source node O and a destination node D together with edge costs such that at most k edges are blocked. The blocked edges are not known a priori and are not recoverable. All of the agents are initially located at O. The objective is to find an online strategy such that at least one of the agents finds a route from the initial location O to a given destination D with minimum total cost. We focus on the case where communication among the agents is limited in the sense that some travelers can both send and receive information while the others can only receive information. We formalize the definition of agents’ intelligence by specifying three levels. We introduce two online strategies which utilize higher levels of agents’ intelligence to provide updated lower bounds to this problem. We show that one of our strategies is optimal in both cases with complete and limited communication in the special case of O–D edge-disjoint graphs and highest level of agents’ intelligence.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bar-Noy A, Schieber B (1991) The Canadian Traveler Problem. In: SODA ’91 Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms, pp 261–270
Bender M, Westphal S (2015) An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths. J Comb Optim 30:87–96. doi:10.1007/s10878-013-9634-8
Eppstein D (1998) Finding the k shortest paths. Siam J Comput 28:652–673
Liao CS, Huang Y (2014) The covering Canadian Traveler Problem. Theor Comput Sci 530:80–88. doi:10.1016/j.tcs.2014.02.026
Liao CS, Huang Y (2015) Generalized Canadian Traveller Problems. J Comb Optim 29:701–712. doi:10.1007/s10878-013-9614-z
Papadimitriou C, Yannakakis M (1991) Shortest paths without a map. Theor Comput Sci 84:127–150
Sleator D, Tarjan R (1985) Amortized efficiency of list update and paging rules. Commun ACM 28:202–208
Su B, Xu Y (2004) Online recoverable Canadian Traveler Problem. In: Proceedings of the international conference on management science and engineering, pp 633–639
Su B, Xu Y, Xiao P, Tian L (2008) A risk-reward competitive analysis for the recoverable Canadian Traveller Problem. In: Proceedings of the second international conference on combinatorial optimization and applications, pp 417–426. doi:10.1007/978-3-540-85097-7_39
Westphal S (2008) A note on the k-Canadian Traveler Problem. Inf Process Lett 106:87–89. doi:10.1016/j.ipl.2007.10.004
Xu Y, Hu M, Su B, Zhu B, Zhu Z (2009) The Canadian Traveler Problem and its competitive analysis. J Comb Optim 18:195–205. doi:10.1007/s10878-008-9156-y
Yen J (1971) Finding the k shortest loopless paths in a network. Manag Sci 17:712–716
Zhang H, Xu Y, Qin L (2013) The k-Canadian Travelers Problem with communication. J Comb Optim 26:251–265. doi:10.1007/s10878-012-9503-x
Zhang H, Tong W, Xu Y, Lin G (2015) The steiner traveling salesman problem with online edge blockages. Eur J Oper Res 243:30–40. doi:10.1016/j.ejor.2014.11.013
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shiri, D., Salman, F.S. On the online multi-agent O–D k-Canadian Traveler Problem. J Comb Optim 34, 453–461 (2017). https://doi.org/10.1007/s10878-016-0079-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-016-0079-8