期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

局内封闭式车辆调度问题及其竞争策略 被引量：11

Competitive Analysis for the Close On-line Truck Scheduling Problem with Time-Window
原文传递
导出
摘要 　基于k-卡车问题和局内运输问题,提出了具有时间窗的局内封闭式车辆调度问题,建立了相关的模型,研究了当车辆数为1时该问题的竞争分析的有关结果,给出了三种不同的竞争策略,得到了相应的竞争比,并进行了理论证明. Base on the k-truck problem and on-line transportation problem, we propose the close on-line Truck Scheduling Problem with Time-window (TSPTW). A relevant model is established. And the case which has only one vehicle is studied and some results are obtained: three different competitive strategies are designed and the relevant competitive ratios are obtained and proved.
作者 马卫民 王刊良
机构地区 清华大学经济管理学院 西安交通大学管理学院
出处 《系统工程理论与实践》 EI CSCD 北大核心 2004年第9期72-78,共7页 Systems Engineering-Theory & Practice
基金 中国博士后科学基金(2003034014) 国家自然科学基金(72101001 70231010)
关键词 局内问题 竞争策略 竞争比 车辆调度 on-line problem competitive strategy competitive ratio truck scheduling
分类号 TB114.1 [理学—运筹学与控制论]
  • 相关文献

参考文献11

  • 1Ma 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.
  • 2AscheuerN , Krumke S O, Rambau J. Competitive scheduling of elevators[R]. Technical report, ZIB Berlin, 1998.
  • 3Ascheuer N, Grotschel M, Krumke S O, Rambau J Combinatorial online optimization[A]. Proceedings of the International Conference of Operations Research Zuriel1(OR'98)[C], Springer, 1998.
  • 4Ausiello G, Feuerstein E, Leonardi S, Stougie L Talamo M. Serving request with on-line routing[A]. Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT'94)[C]. Lecture Notes in Computer Science, 1994, 824:37-48.
  • 5Ausiello G, Feuerstein E, Leonardi S, Stougie L, Talamo M. Competitive algorithms for the traveling salesman[A]. Proceedings of the 4th Workshop on Algoridu11s and Data Structures (WADS'95)[C]. Lecture Notes in Computer Science, 1995,955:206-217.
  • 6Ausiello G, Leonardi S, A Marchetti-Spaccamela. On salesmen, repairmen and other travelling agents[A]. Invited paper to the 4th Italian Conference on Algorithms and Complexity (CIAC '00)[C], 2000,LNCS 1767: 1-16.
  • 7Sleator D D, Tarjan R E. Amortized efficiency of list update and paging rules[A]. Communications of the ACM[C], 1985, 28: 202-208.
  • 8Ma W M, Xu Y F, You J, Liu J, Wang K L. New Result on the k-truck scheduling problem[A]. The Eighth Annual International Computing and Combinatorics Conference (COCOON'02)[C], Lecture Notes in Computer Science 2387, pp. 504-513, Singapore, 2002.
  • 9马卫民,王刊良.局内管理决策问题及其竞争策略[J].管理科学学报,2003,6(2):29-34. 被引量：19
  • 10马卫民,徐青川.局外k-出租车问题及其动态规划求法[J].系统工程学报,2001,16(6):481-485. 被引量：10

二级参考文献13

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量：26
  • 2[1]Manasse M S,McGeoch L A,Sleator D D.Competitive algorithms for server problems[J].Journal of Algorithms,1990,(11):208-230
  • 3[2]David S B,Borodin A.A new measure for the study of the on-line algorithm[J].Algorithmica,1994,(11):73-91
  • 4[3]Koutsoupias E,Papadimitriou C.On the k-server conjecture[J],Journal of ACM,1995,42(5):971-983
  • 5[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
  • 6马卫民,徐寅峰,王刊良.局内k-卡车调度问题的竞争策略[J].西北大学学报(自然科学版),1999,29(4):254-258.
  • 7[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
  • 8[11]Chrobak M, Larmore L L. Metrical task systems,the server problem,and the work function algorithm[J]. On-line Algorithms: State of Art,Berlin: Springer Verlag,1998.74-94
  • 9[12]Bein W W, Chrobak M,Larmore L L. The 3-server problem in the plane[C]. ESA99. 7th Annual European Symposium, Berlin:Springer Verlag,2000.301-312
  • 10马卫民,刘新梅.售后服务交通费用管理的竞争策略[J].华中科技大学学报（自然科学版）,2001,29(1):105-107. 被引量：4

共引文献27

同被引文献73

引证文献11

二级引证文献41

系统工程理论与实践
2004年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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