CORC  > 清华大学
路网优化中基于随机连接概率的最短路径算法
周磊 ; 杨磊 ; 刘卫朋 ; ZHOU Lei ; YANG Lei ; LIU Wei-peng
2010-05-14 ; 2010-05-14
关键词最短路 连接概率 网络优化 概率邻接矩阵 shortest path connective probability network optimization connective probability matrix TP18
其他题名A Shortest-Path Algorithm based on Stochastic Concention in Road Network Optimization
中文摘要文章通过对现代交通问题的分析,研究了一种基于两点之间有连接概率的网络最短路模型。基于对节点的连接概率和边的权值两方面综合考虑,提出了一种寻找最短路的算法。此算法应用标号法的思想,对标号法中的迭代过程加以改进,把接点的连接概率和边的权值同时加以考虑,进行计算。最后,通过实例验证了此算法的可行性和有效性。; This paper,through the analysis of modern traffic problem,a shortest path problem based on stochastic connection between two points is studied.In consideration of the connective probability between two points and weight of edges,an algorithm to solve the problem is proposed.By using the idea of floyed,iterative process of the algorithm is improved,the shortest path considering the connective probability between two points and weight of edges is computed.Finally,analysis on the example indicates that the algorithm is feasible and effective.
语种中文 ; 中文
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/33395]  
专题清华大学
推荐引用方式
GB/T 7714
周磊,杨磊,刘卫朋,等. 路网优化中基于随机连接概率的最短路径算法[J],2010, 2010.
APA 周磊,杨磊,刘卫朋,ZHOU Lei,YANG Lei,&LIU Wei-peng.(2010).路网优化中基于随机连接概率的最短路径算法..
MLA 周磊,et al."路网优化中基于随机连接概率的最短路径算法".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace