%0 Journal Article
%T Online Canadian Traveler Problem with Stochastic Blockages Recovery Time<br>堵塞恢复时间随机的在线加拿大旅行者问题
%A SU Bing
%A XU Yin-feng
%A <br>苏兵
%A 徐寅峰
%J 系统工程理论与实践
%D 2005
%I 
%X The online Canadian Traveler Problem(CTP for short) is considered for the case when the traveler meets some unexpected accident or a series of unexpected accidents during the travel process.From the online point of view,The Waiting strategy and the Greedy strategy are proposed and the competitive ratios of the two strategies are given based on the assumption that each blockage recovery time is a uniform distributed,and the performance of these two strategies are analyzed and compared.
%K stochastic blockage recovery time
%K online canadian traveler problem
%K competitive ratio<br>堵塞恢复时间随机
%K 在线加拿大旅行者问题
%K 竞争比
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=DBDA18475D50ED22&yid=2DD7160C83D0ACED&vid=C5154311167311FE&iid=F3090AE9B60B7ED1&sid=6270DC1B5693DDAF&eid=A63576421B012172&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=9