期刊文献+

一条路上的占线可恢复加拿大旅行者问题混合策略 被引量:6

The Mixed Strategy Research on Online RecoverableCanadian Traveler Problem on One Road
原文传递
导出
摘要 针对旅行者在行走过程中遇到某一或一系列无法预知的堵塞事件的可恢复加拿大旅行者问题,考虑堵塞只发生在一条特殊路径上且堵塞可恢复的情形,提出了以一定概率分布对等待与迂回策略进行选择的混合策略,并讨论了无偏好和有偏好混合策略以及相应策略下的竞争性能比。 The online recoverable Canadian traveler problem on one road is considered for the case when the blockages occur one by one without any predictable information except its recover time during the travel process. The mixed strategy that the traveler chooses waiting strategy and circuity strategy with some probabilities is proposed. The mixed strategy with preference and mixed strategy without preference and their performances of competitive ratio are analyzed.
出处 《系统工程理论方法应用》 北大核心 2005年第4期318-321,325,共5页 Systems Engineering Theory·Methodology·Applications
基金 国家自然科学基金资助项目(10371094 70121001)
关键词 占线可恢复加拿大旅行者问题 竞争性能比 混合策略 online recoverable Canadian traveler problem competitive ratio mixed strategy
  • 相关文献

参考文献6

  • 1Papadimitriou C H, Yannakakis M. Shortest paths without a map [J]. In Proc. 16th ICALP, Lect Notes in Comp. Sci. , 1989, 372:610-620.
  • 2Manasse M S, A McGeoch L, Sleator D D.Competitive algorithms for server problems [J].Journal of Algorithms, 1990, 11:208-230.
  • 3David S B, Borodin A. A new measure for the study of the on-line algorithm [J]. Algorithmic, 1994, 11:73-91.
  • 4Bar-Noy A, Schieber B. The Canadian traveler problem[J]. Proc The Second Annual ACM-SIAM Symposium on Discrete Algorithms, 1991. 261-270.
  • 5Su B, Xu Y F, Xu Y, et al. Online recoverable Canadian traveler problem on a road [J].Information, 2004, 7(4): 477-486.
  • 6苏兵,徐寅峰.连续网络上的占线可恢复加拿大旅行者问题[J].系统工程,2004,22(8):10-13. 被引量:8

二级参考文献7

  • 1Papadimitriou C H,Yannakakis M. Shortest paths without a map[A]. Proc.16th ICALP, Lect Notes in Comp. Sci. No.,1989,372:610~620.
  • 2Manasse M S, McGeoch L A, Sleator D D. Competitive algorithms for server problems[J]. Journal of Algorithms,1990,11:208~230.
  • 3David S B,Borodin A. A new measure for the study of the on-line algorithm[J]. Algorithmic, 1994, 11:73~91.
  • 4Amotz B N, Schieber B. The Canadian traveller problem[A]. Proc. the second annual ACM-SIAM symposium on discrete algorithms[C]. 1991:261~270.
  • 5Su B,Xu Y F,Xu Y,Zhu Z J. Online recoverable Canadian traveler problem on a road[J]. Information,2004,7(4).
  • 6苏兵 徐渝 徐寅峰.联机可恢复加拿大旅行者问题的研究[J].系统工程理论与实践,2004,.
  • 7Chrobak M,Larmore L L. An optimal on-line algorithm for K-servers on trees[J]. SIAM J.Comput,1991,20(1):144~148.

共引文献7

同被引文献51

引证文献6

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部