A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem

  • Authors:

  • Bing Su;Yinfeng Xu;Peng Xiao;Lei Tian

  • Affiliations:

  • School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and School of Economics and Management, Xi'an Technological University, Xi'an, P.R. China 710032;School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and The State Key Lab for Manufacturing Systems Engineering, , Xi'an, P.R. China 710049;School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and The State Key Lab for Manufacturing Systems Engineering, , Xi'an, P.R. China 710049;School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049

  • Venue:
  • COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.