期刊文献+

出行者信息未知下的修缮路段选择研究

Study on the Selection of Road Section for the Repair Based on Information Unknown to the Traveller
下载PDF
导出
摘要 本文从路段修缮导致道路网络总通行时间变化的角度,提出衡量修缮路段影响道路网络运行效率的度量指标——道路网络总通行时间增比系数,即路段修缮后道路网络最小总通行时间与路段修缮前道路网络最小总通行时间之间的比值。在此基础上,假设出行者只有到达修缮路段的起点时才获知该路段发生中断的信息,给出道路网络总通行时间增比最小的修缮路段定义及其计算方法,旨在为城市道路改造和道路设计提供依据。 From the point of the change of the minimum sum travel times of a transportation network by road sections repaired, an enhancement ratio coefficient of sum travel times is present to measure the influence of repairing road sec-tions on transportation network, which is the ratio of minimum sum travel times after road sections repaired to the before. This paper gives the model and algorithm of the repairing road section of minimum enhancement ratio coefficient of the network under the assumption that the traveller can obtain the information of the repairing road section only in reaching the starting vertex of the section, aim to give some suggestions for policy-makers to plan road sections.
出处 《预测》 CSSCI 北大核心 2013年第6期78-80,72,共4页 Forecasting
基金 国家社会科学基金资助项目(13BGL156) 教育部人文社会科学基金资助项目(12YJAZH121) 长江学者和创新团队发展计划资助项目(IRT1173) 西安工业大学校长基金资助项目(XGYXJJ0539) 陕西省教育厅科研计划资助项目(11JK0980)
关键词 信息未知 修缮路段 总通行时间增比 information unknown repairing road section the enhancement ratio of sum travel times
  • 相关文献

参考文献10

  • 1苏兵,徐寅峰.运输过程中路径突发堵塞事件对策研究[J].预测,2005,24(2):76-80. 被引量:13
  • 2Corley H W, Sha D Y. Most vital links and nodes in weighted networks [ J ]. Operation Research Letters, 1982, 1(4): 157-161.
  • 3Nardelli E, Proietti G, Widmayer P. Finding the detour- critical edge of a shortest path between nodes [ J ]. Infor- mation Processing Letters, 1998, 67 ( 1 ) : 51-54.
  • 4Su B, Xu Q, Xiao P. Finding the anti-block vital edge ofa shortest path between two nodes[ J]. Journal of Combi- natorial Optimization, 2008, 16 ( 2 ) : 173-181.
  • 5Xiao P, Xu Y, Su B. Finding an anti-risk path between two nodes in undirected graphs [ J 1. Journal of Combina- torial Optimization, 2009, 17 (3) : 235-246.
  • 6石超峰,徐寅峰.交通网络最大流关键边[J].系统工程,2009,27(9):55-59. 被引量:8
  • 7Oyama T, Morohosi H. Applying the shortest-path- counting problem to evaluate the importance of city road segments and the connectedness of the network-structured system [ J ]. International Federation of Operational Research Societies, 2004, 11 ( 5 ) : 555-573.
  • 8闫化海.道路中断情形下的实时关键边和关键点研究[D].西安:西安交通大学,2006.
  • 9Wardrop J G. Some theoretical aspects of road traffic research [ A ]. Proceedings of the Institution of Civil Engineers, Part II[ C]. London, 1952. 325-378.
  • 10Frank M, Wolfe P. An algorithm for quadratic program- ming [ J ] Naval Research Logistic Quarterly, 1956, (3) : 95-110.

二级参考文献11

  • 1李引珍,郭耀煌.交通运输网络最短路径关键边问题研究[J].中国管理科学,2004,12(4):69-73. 被引量:28
  • 2闫化海,徐寅峰.不完全信息下交通网络最短路径关键边问题[J].系统工程,2006,24(2):37-40. 被引量:17
  • 3刘明,徐寅峰,杜源江,肖鹏.不完全信息下交通网络的关键路径问题[J].系统工程,2006,24(12):16-20. 被引量:16
  • 4Corley H W, Sha D Y. Most vital links and nodes in weighted networks[J]. Operation Research Letters, 1982,(1) :157-161.
  • 5Malik K, Mittal A K, Gupta S K. The k most vital arces in the shortest path problem[J]. Operation Research Letters, 1989, (8) : 223-227.
  • 6Nardelli E,Proietti G,Widmyer P. A faster computation of the most vital edge of a shortest path between two nodes[J].Information Processing Letters,2001, 79(2):81-85.
  • 7Manasse S M, McGeoch L A, Sleator D D.Competitive algorithms for server problems[J].Journal of Algorithms,1990,11:208-230.
  • 8David S B, Borodin A.A new measure for the study of the on-line algorithm[J].Algorithmica, 1994,11:73-91.
  • 9Keskinocak P, Ravi R, Tayur S.Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues[J].Management Science, 2001,47(2):264-279.
  • 10朱志军,徐寅峰.加拿大旅行者问题[J].系统工程理论方法应用,2003,12(2):177-181. 被引量:5

共引文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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