• ISSN 0258-2724
  • CN 51-1277/U
  • EI Compendex
  • Scopus 收录
  • 全国中文核心期刊
  • 中国科技论文统计源期刊
  • 中国科学引文数据库来源期刊

多属性随机时间依赖网络路径优化

陈京荣,  俞建宁,  李引珍

downloadPDF
文章导航 > 西南交通大学学报  > 2012 >  25(2): 291-298.
陈京荣, 俞建宁, 李引珍. 多属性随机时间依赖网络路径优化[J]. 西南交通大学学报, 2012, 25(2): 291-298. doi: 10.3969/j.issn.0258-2724.2012.02.020
引用本文: 陈京荣, 俞建宁, 李引珍. 多属性随机时间依赖网络路径优化[J]. 西南交通大学学报, 2012, 25(2): 291-298. doi: 10.3969/j.issn.0258-2724.2012.02.020
shu
CHEN Jingrong, YU Jianning, LI Yinzhen. Path Optimization in Stochastic and Time-Dependent Networks with Multi-attributes[J]. Journal of Southwest Jiaotong University, 2012, 25(2): 291-298. doi: 10.3969/j.issn.0258-2724.2012.02.020
Citation: CHEN Jingrong, YU Jianning, LI Yinzhen. Path Optimization in Stochastic and Time-Dependent Networks with Multi-attributes[J]. Journal of Southwest Jiaotong University, 2012, 25(2): 291-298. doi: 10.3969/j.issn.0258-2724.2012.02.020
shu

多属性随机时间依赖网络路径优化

doi: 10.3969/j.issn.0258-2724.2012.02.020
基金项目: 

国家自然科学基金资助项目(61164003)

甘肃省自然科学基金资助项目(1010RJZA066)

甘肃省教育厅科研项目(1004-01)

Path Optimization in Stochastic and Time-Dependent Networks with Multi-attributes

    摘要
  • 摘要: 为了改善实时交通诱导,根据交通网络中路段属性具有随机时间依赖性的特点,将路段各属性定义为关于时间的离散随机变量,建立了多属性条件下随机时间依赖网络路径优化模型.基于信息熵的多属性决策方法,设计了模型的求解算法;优化了网络节点的搜索顺序,使每个节点的信息只通过一步更新就可得到,从而获得多属性条件下所有节点到给定终点的路径选择结果,出行者可以根据到达某节点的具体时刻选择行进方向.最后,通过算例给出了算法的实现过程，并说明了随机时间依赖网络不遵从先进先出(FIFO)条件.

     

    Abstract: 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.

     

    • HTML全文
    • 参考文献(1)
  • Climaco J C, Martins E Q.A bicriterion shortest path algorithm[J].European Journal of Operational Research,1982,11(4):399-404 [2]Martins E Q.On a multicriteria shortest path problem[J].European Journal of Operational Research,1984,16(2):236-245 [3]Zografos K G, Davis C F.Multi-objective programming approach for routing hazardous materials[J].Journal of Transportation Engineering,1989,115(6):661-673 [4]Modesti P, Sciomachen A.A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks[J].European Journal of Operational Research,1998,111(3):495-508 [5]Henig M I.The shortest path problem with two objective functions[J].European Journal of Operational Research,1986,25(2):281-291 [6]Mirchandani P B, Wiecek M M.Routing with nonlinear multiattribute cost functions[J].Applied Mathematics and Computation,1993,54(2):215-239 [7]Mirchandani P B, Soroush H.Optimal paths in probabilistic networks: A case with temporary preferences[J].Computers and Operations Research,1985,12(4):365-381 [8]Turnquist M A. Routes.nullschedules and risks in transporting hazardous materials[J].. Strategic Planning in Energy and Natural Resources, North-Holland, Amsterdam,1987,:- [9]Wijeratne A B, Turnquist M A, Mirchandani P B.Multiobjective routing of hazardous materials in stochastic networks[J].European Journal of Operational Research,1993,65(1):33-43 [10]Nozick L K, List G F, Turnquist M A.Integrated routing and scheduling in hazardous materials transportation[J].Transportation Science,1997,31(3):200-215 [11]Cai X, Kloks T, Wong C K.Time-varying shortest path problems with constraints[J].Networks,1997,29(3):141-149 [12]William H K Lam, Zhi-Chun Li, Hai-Jun Huang, Wong S C.Modeling time-dependent travel choice problems in road networks with multiple user classes and multiple parking facilities[J].Transportation Research Part B,2006,40(5):368-395 [13]Chang T S, Nozick L K, Turnquist M A.Multi-objective path-finding in stochastic dynamic networks with application to routing hazardous materials shipments[J].Transportation Science,2005,39(3):383-399 [14]Opasanon S, Miller-Hooks E D.Multicriteria adaptive paths in stochastic, time-varying networks[J].European Journal of Operational Research,2006,173(1):72-91 [15]Miller-Hooks E D, 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 [16]Gao S, Chabini I.Optimal routing policy problems in stochastic time-dependent networks[J].Transportation Research Part B,2006,40(2):93-122 [17]Iredi S. Merkle D.[J].Middendorf M. Bi-criterion optimization with multi colony ant algorithms[C]. The First International Conference on Multi-Criterion Optimization, Zurich, Switzerland, March 7-,2001,:- [18]Sitarz S.Ant algorithms and simulated annealing for multi-criteria dynamic programming[J].Computer operations research,2009,36:433-441 [19] 陈京荣,俞建宁,李引珍.随机时间依赖交通网络自适应路径优化[J].2009,44[J].西南交通大学学报,2009,44(4):523-529 [20] [21] 徐则水.不确定多属性决策方法及应用[M].北京:清华大学出版社,Springer出版,2004,8-27
    • 相关文章
    • 施引文献
  • 附加材料(0)
  • 加载中
WeChat 点击查看大图
计量
  • 文章访问数:  2767
  • HTML全文浏览量:  68
  • PDF下载量:  435
  • 被引次数: 0
出版历程
  • 收稿日期:  2011-03-17
  • 修回日期:  2011-10-19
  • 刊出日期:  2012-04-25

目录

    /

    返回文章
    返回

    Copyright © 2009 西南交通大学学报

    地址：四川省成都市郫都区犀安路999号西南交通大学犀浦校区《西南交通大学学报》编辑部

    电话：028-66367562传真：028-66366552Email：xbz@home.swjtu.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 技术支持： info@rhhz.net