期刊文献+

多属性随机时间依赖网络路径优化 被引量:8

Path Optimization in Stochastic and Time-Dependent Networks with Multi-attributes
下载PDF
导出
摘要 为了改善实时交通诱导,根据交通网络中路段属性具有随机时间依赖性的特点,将路段各属性定义为关于时间的离散随机变量,建立了多属性条件下随机时间依赖网络路径优化模型.基于信息熵的多属性决策方法,设计了模型的求解算法;优化了网络节点的搜索顺序,使每个节点的信息只通过一步更新就可得到,从而获得多属性条件下所有节点到给定终点的路径选择结果,出行者可以根据到达某节点的具体时刻选择行进方向.最后,通过算例给出了算法的实现过程,并说明了随机时间依赖网络不遵从"先进先出(FIFO)"条件. In order to improve the real-time traffic guidance,all the attributes for each section were defined as discrete random variables with respect to time in the light of the stochastic and time-dependent properties of attributes of sections in traffic networks.Based on the above,a model of path optimization was built for stochastic and time-dependent networks with multi-attributes.The multiple attribute decision making based on the information entropy theory was used to get the algorithm for the model.In this model,by adjusting the search order of nodes the information of each node can be obtained through only one computational step,the results of path selection can be achieved from all nodes to a specified destination in multi-attributes,then a traveler can get his ways by the arrival time.In the end,an example was given to illustrate the concrete steps of the algorithm and prove that stochastic and time-dependent networks do not follow "first in,first out" condition.
出处 《西南交通大学学报》 EI CSCD 北大核心 2012年第2期291-298,共8页 Journal of Southwest Jiaotong University
基金 国家自然科学基金资助项目(61164003) 甘肃省自然科学基金资助项目(1010RJZA066) 甘肃省教育厅科研项目(1004-01)
关键词 随机时间依赖网络 多属性 路径优化 算法 stochastic and time-dependent network multi-attribute path optimization algorithm
  • 相关文献

参考文献20

  • 1CLIMACO J C,MARTINS E Q. A bicriterion shortest path algorithm[J].European Journal of Operational Research,1982,(04):399-404.
  • 2MARTINS E Q. On a multicriteria shortest path problem[J].European Journal of Operational Research,1984,(02):236-245.
  • 3ZOGRAFOS K G,DAVIS C F. Multi-objective programming approach for routing hazardous materials[J].Journal of Transportation Engineering,1989,(06):661-673.
  • 4MODESTI P,SCIOMACHEN A. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks[J].European Journal of Operational Research,1998,(03):495-508.
  • 5HENIG M I. The shortest path problem with two objective functions[J].European Journal of Operational Research,1986,(02):281-291.
  • 6MIRCHANDANI P B,WIECEK M M. Routing with nonlinear multiattribute cost functions[J].Applied Mathematics and Computation,1993,(02):215-239.
  • 7MIRCHANDANI P B,SOROUSH H. Optimal paths in probabilistic networks:A case with temporary preferences[J].Computers and Operations Research,1985,(04):365-381.
  • 8TURNQUIST M A. Routes,schedules and risks in transporting hazardous materials[A].Amsterdam:Elsevier Science,1987.289-302.
  • 9WIJERATNE A B,TURNQUIST M A,MIRCHANDANI P B. Multiobjective routing of hazardous materials in stochastic networks[J].European Journal of Operational Research,1993,(01):33-43.
  • 10CAI X,WONG C K,KLOKS T. Time-varying shortest path problems with constraints[J].Networks,1997,(03):141-149.doi:10.1002/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H.

二级参考文献17

  • 1王行风,贾凌.GIS支持下的城市交通网络最短路径研究[J].计算机与现代化,2005(3):9-12. 被引量:12
  • 2POLYCHRONOPOULOS G H.Stochastic shortest path problems with recourse[J].Networks,1996,27(2):133-143.
  • 3FRANK H.Shortest path in probabilistic graphs[J].Operations Research,1969,17(4):583-599.
  • 4WALLER S T,ZILIASKOPOULOS A K.On the on-line shortest path problem with limited arc cost dependencies[J].Networks,2002,40(4):216-227.
  • 5FU L.An adaptive routing algorithm for in-vehicle route guidance systems with real-time information[J].Transportation Research Part B,2001,35(8):749-765.
  • 6COOKE K L,HALSEY E.The shortest route through a network with time-dependent internode transit times[J].Journal of mathematical analysis and applications,1966,14:493-498.
  • 7CHABINI I.Discrete dynamic shortest path problems in transportation applications[J].Transportation Research Record,1998,1645:170-175.
  • 8PRETOLANI D.A directed hypergraph model for random time dependent shortest paths[J].European Journal of Operational Research,2000,123(2):316-324.
  • 9DAVIES C,LINGRAS P.Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks[J].European Journal of Operational Research,2003,144(1):27-38.
  • 10MILLER-HOOKS E,MAHMASSANI H.Path comparisons for a priori and time-adaptive decisions in stochastic,time-varying networks[J].European Journal of Operational Research,2003,146(1):67-82.

共引文献1

同被引文献77

引证文献8

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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