期刊文献+

自然灾害环境中的在线导航问题竞争分析

Competitive Analysis for Online Navigating Problem in the Natural Disasters
下载PDF
导出
摘要 以旅行者的旅行时间最短为优化目标,用竞争分析的方法考虑了自然灾害环境中的在线导航问题,提出了旅行者在受灾区行走的上界控制策略,通过竞争比和竞争性能分析,结果表明上界控制策略具有该问题最优竞争比2k+1,并且竞争性能得到了提高. In this paper, by using a method of competitive analysis, the online navigating problem in the environment of natural disasters to realize the aim of a less-minimum-time for the online traveling is studied. We give the strategy of controlling upper bound and its algorithmic model. Through analyzing the competitive ratio and competitive performance of the strategy, the result clearly shows that the strategy of controlling upper bound matches well the optimal competitive ratio 2k + 1 of the problem and its competitive performance is advanced.
出处 《宁夏师范学院学报》 2009年第6期5-10,共6页 Journal of Ningxia Normal University
基金 宁夏自然科学基金资助项目(NZ08172) 宁夏师范学院校级科研项目(YB08024)
关键词 在线导航问题 上界控制策略 竞争比 竞争性能 Online navigating problem Strategy of controlling upper bound Sompetitive ratio Competitive performance
  • 相关文献

参考文献9

  • 1Bar - Noy A, Schieber B. The Canadian traveller problem[C], in: SODA'91 :Proceedings of the Second Annual ACM - SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1991,261 - 270.
  • 2Yinfeng Xu, Maolin Hu, Bing Su, et al. The canadian traveller problem and its competitive analysis [ J ]. J Comb Optim,2008, DOI 10. 1007/s10878 - 008 - 9156 --y.
  • 3Manasse M S, Me Geoeh L A, SleatorD D. Competitive algorithms for server problems [ J ]. Journal of Algorithms, 1990,11 ( 2 ) : 208 - 230.
  • 4David S B, Borodin A. A new measure for the study of the on-line algorithm [ J ]. Algorithmica, 1994,11 ( 1 ) :73-91.
  • 5Koutsoupias E, Papadimitriou C. On the k-server conjecture [ J ]. Journal of ACM, 1995,42 ( 5 ) :971 - 983.
  • 6Alon N, Karp P M, Peleg D, et al. A graph-theoretic game and its application to the k-server problem [ J ]. SIAMJ Comput, 1995,24( 1 ) :78 - 100.
  • 7堵丁柱.k车服务问题与竞争算法[J].数学的实践与认识,1991,21(4):36-40. 被引量:40
  • 8胡茂林,徐寅峰,徐维军.堵塞点可恢复型在线运输车辆的调度策略研究[J].系统工程学报,2006,21(5):484-489. 被引量:7
  • 9朱志军,徐寅峰,刘春草.局内车辆选线问题和竞争策略分析[J].系统工程学报,2003,18(4):324-330. 被引量:16

二级参考文献17

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 2Manasse M S, McGeoch L A, Sleator D D. Competitive algorithms for server problems[J]. Journal of Algorithms, 1990, 11 (2) :208--230.
  • 3David S B, Borodin A. A new measure for the study of the on-line algorlthm[J]. Algorithmica, 1994, 11 (1) : 73--91.
  • 4Koutsoupias E, Papadimitriou C. On the k-server conjecture[J]. Journal of ACM, 1995, 42(5): 971--983.
  • 5Alon N, Karp R M, Peleg D, et al. A graph-theoretic game and its application to the k-server problem[J]. SIAM J Comput,1995, 24(1) : 78--100.
  • 6Pinnoi A, Tung D T. Vehicle routing-scheduling for waste collection in Hanoi[J]. European Journal of Operational Research, 2000,125 (3): 449--468.
  • 7Xu Y .Y, Wang K L, Zhu B H. On the k-taxi problem[J]. Information Pmeesaing Letter, 1999, 2 (4): 429--434.
  • 8Koutsoupias E, Taylor D S. The CNN Problem and Other k-server Variants[C]. In 17th Annual Symposium on Theoretical Aspects of Computer Science. Lille, France:Springer, 17--19 February 2000.
  • 9Manasse M S,McGeoch L A,Sleator D D.Competitive algorithms for server problems[J].Journal of Algorithms,1990,11(2):208-230.
  • 10David S B,Borodin A.A new measure for the study of the on-line algorithm[J].Algorithmica,1994,11(1):73-91.

共引文献56

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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