A risk-reward competitive analysis for the recoverable Canadian traveller problem

12Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

From the online point of view, we study the Recoverable Canadian Traveller Problem (Recoverable-CTP) in a special network, in which the traveller knows in advance the structure of the network and the travel time of each edge. However, some edges may be blocked and the traveller only observes that upon reaching the vertex of the blocked edge, and the blocked edge may be reopened but the traveller doesn't know its recovery time. The goal is to find a least-cost route from the origin node to the destination node, more precisely, to find an adaptive strategy minimizing the ratio of traversed time to the travel time of the optimal offline shortest path (where all blocked edges and their recovery time are known in advance). We present an optimal online strategy - a comparison strategy and prove its competitive ratio. Moreover, with the different forecasts of the recovery time, some online strategies are given under the risk-reward framework, and the rewards and the risks of the different strategies are analysed. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Su, B., Xu, Y., Xiao, P., & Tian, L. (2008). A risk-reward competitive analysis for the recoverable Canadian traveller problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 417–426). https://doi.org/10.1007/978-3-540-85097-7_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free