期刊文献+

局内军车调度的时间优化及其竞争策略 被引量:10

Time optimization of on-line k-military-truck scheduling and its competitive strategies
在线阅读 下载PDF
导出
摘要 提出时间目标函数下的局内 k-军车调度问题 .应用复位策略给出该问题的几种竞争算法 :给出了对应的局内 k-服务器问题的竞争比为 c时的该问题的竞争比为 c+1+1/ θ的竞争算法 ;分别给出了当 k=n和 k=n- 1时该问题的竞争比为 1和 On line k military truck problem with objective function of time is originally proposed in this paper. Employing the position maintaining strategy, some competitive algorithms for this on line problem are given: an algorithm with competitive ratio c +1+1/ θ when the competitive ratio of relevant k server problem is c ; two algorithms with competitive ratio 1 and 1+1/ θ when k=n and k=n -1, respectively.
出处 《系统工程学报》 CSCD 2002年第5期395-400,429,共7页 Journal of Systems Engineering
关键词 军车调度 时间优化 竞争策略 军用物资调运部门 目标函数 on line k military truck problem competitive algorithm competitive ratio
  • 相关文献

参考文献12

  • 1[1]Manasse M S,McGeoch L A,Sleator D D.Competitive algorithms for server problems[J].Journal of Algorithms,1990,(11):208-230
  • 2[2]David S B,Borodin A.A new measure for the study of the on-line algorithm[J].Algorithmica,1994,(11):73-91
  • 3[3]Koutsoupias E,Papadimitriou C.On the k-server conjecture[J],Journal of ACM,1995,42(5):971-983
  • 4[4]Alon 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
  • 5堵丁柱.k车服务问题与竞争算法[J].数学的实践与认识,1991,21(4):36-40. 被引量:41
  • 6徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 7马卫民,徐寅峰,王刊良.局内k-卡车调度问题的竞争策略[J].西北大学学报(自然科学版),1999,29(4):254-258.
  • 8马卫民,刘新梅.售后服务交通费用管理的竞争策略[J].华中科技大学学报(自然科学版),2001,29(1):105-107. 被引量:4
  • 9马卫民,徐青川.局外k-出租车问题及其动态规划求法[J].系统工程学报,2001,16(6):481-485. 被引量:10
  • 10[10]Ma W M, Xu Y F,Wang K L.k-Truck problem and its competitive algorithms[J]. Journal of Global Optimization,2001,21:15-25

二级参考文献3

共引文献55

同被引文献49

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 2马卫民,王刊良.局内封闭式车辆调度问题及其竞争策略[J].系统工程理论与实践,2004,24(9):72-78. 被引量:11
  • 3徐维军,徐寅峰,卢致杰.具有几何分布统计特征的在线租赁竞争分析[J].预测,2005,24(2):46-51. 被引量:16
  • 4马卫民,陈国青.成对需求的局内k-服务器问题及其工作函数策略[J].系统工程理论与实践,2005,25(7):98-104. 被引量:3
  • 5Ausiello G, Feuerstein E, Leonardi S, et al. competitive algorithms for the traveling salesman[ A]. In: Proceedings of the 4th Workshop on Algorithm and Data Structures (WADS'95), Lecture Notes in Computer Science[ C]. Berlin: Springer 1995, 955:206-217.
  • 6Ausiello G, Leonardi S, Spaccamela A M. On salesmen, repairmen and other travelling agents[ A]. In: Invited Paper to the 4th Italian Conference on Algorithms and Complexity (CIAC '00), LNCS[ C ]. Berlin: Springer, 2000, 1767: 1-16.
  • 7Sleator D D, Tarjan R E. Amortized efficiency of list update and paging rules[J]. Communications of the ACM, 1985, 28: 202-208.
  • 8Ma W M, Xu Y F, You J, et al. New result on the k-truck scheduling problem[ A]. In: The Eighth Annual International Computing and Combinatorics Conference (COCOON'02)[ C]. Singapore: Lecture Notes in Computer Science, 2002, 2387: 504-513.
  • 9Ma W M, Xu Y F, Wang K L. k-truck problem and its competitive algorithms[J]. Journal of Global Optimization, 2001, 21 (1):15-25.
  • 10Ascheuer N, Krumke S O, Rambau J. Online dial-a-ride problems: Minimizing the completion time[A]. In: Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, Vol 1770 of Lecture Notes in Computer Science[ C].Berlin: Springer, 2000, 639-650.

引证文献10

二级引证文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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