期刊文献+

基于特殊路径的局内车辆路径问题混合策略研究 被引量:1

Mixed Strategies for the Online Vehicle Routing Problem on a Special Road
下载PDF
导出
摘要 针对运输途中遇到的某一或一系列无法预知的堵塞事件对决策者路径选择策略的影响,考虑堵塞只发生在一条特殊路径上且可恢复的情况,采用局内竞争分析的思想,建立了局内车辆路径问题的数学模型,对车辆到达堵塞点时堵塞恢复时间未知这一情形下的路径选择问题,提出了两种混合策略,给出了相应的竞争比,并对其竞争性能进行了理论分析。 This paper studies the vehicle routing problem with a series of unexpected congested nodes.First,an online model is formulated for the case that the congested nodes only occur on a special road.It is assumed that a congested node can only be known after the vehicle reaches it,and its recovery time is uncertain(i.e.,the information about both the congested node and its recovery time is released in an online fashion).After that,two mixed strategies are proposed to address the problem.Furthermore,the competitive analysis of these two strategies and their competitive ratios are provided.
出处 《运筹与管理》 CSCD 北大核心 2011年第5期57-62,共6页 Operations Research and Management Science
基金 国家自然科学基金项目(70671004 71071113) 全国优秀博士论文作者专项科研资金资助(200782) 高等学校博士学科点专项科研基金(20100072110011) 上海市教育委员会曙光计划基金(08SG21) 上海市浦江人才计划基金 上海市哲学社会科学规划课题(2010BZH003)
关键词 运筹学 混合策略 竞争分析 局内车辆路径问题 恢复时间未知 operational research mixed strategy competitive analysis online vehicle routing problem unknown recovery time
  • 相关文献

参考文献16

  • 1Dantzig G, Ramser J. The truck dispatching problem[ J]. Management Science, 1959, (6) : 80-91.
  • 2Sleator D D, Tarjan R E. Amortized efficiency of list update and paging rules[ J]. Communications of the ACM, 1985, 28 : 202-208.
  • 3Manasse M S, McGeoch L A, Sleator D 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 R M, Peleg D, et al. A graph-theoretic game and its application to the k-server problem[ J]. SIAM Journal on Computing, 1995, 24( 1 ) : 78-100.
  • 7马卫民,王刊良.局内管理决策问题及其竞争策略[J].管理科学学报,2003,6(2):29-34. 被引量:19
  • 8徐维军,徐寅峰,卢致杰,徐金红.占线决策问题及竞争分析方法[J].系统工程,2005,23(5):106-110. 被引量:19
  • 9EI-Yaniv R, Kaniel R, Linial N. Competitive optimal on - line leasing[ J]. Algorithmica, 1999, 25 : 116-140.
  • 10Ausiello G, Feuerstein E, et al. Algorithms for the on- line travelling salesman[ J]. Algorithmiea, 2001, 29: 560-581.

二级参考文献31

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 2朱志军,徐寅峰,徐维军.局内租赁问题的风险补偿模型及其竞争分析[J].管理科学学报,2004,7(3):64-68. 被引量:29
  • 3Manasse M S, McGeoch L A, Sleator D 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 algorlthm[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 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.
  • 7Pinnoi A, Tung D T. Vehicle routing-scheduling for waste collection in Hanoi[J]. European Journal of Operational Research, 2000,125 (3): 449--468.
  • 8Xu Y .Y, Wang K L, Zhu B H. On the k-taxi problem[J]. Information Pmeesaing Letter, 1999, 2 (4): 429--434.
  • 9Koutsoupias 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.
  • 10Manasse S M, McGeoch L A, Sleator D D.Competitive algorithms for server problems[J].Journal of Algorithms,1990,11:208-230.

共引文献64

同被引文献8

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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