节点间有转向限制的网络最优路径算法  

Optimal path algorithm for network with direction-prohibited routes among some nodes

作　　者：范昌胜[1] 郭强[1] 岳爱峰[2] 

机构地区：[1]西北工业大学理学院应用数学系,西安710129 [2]山东师范大学图书馆,济南250014

出　　处：《计算机工程与应用》2009年第23期59-62,共4页Computer Engineering and Applications

摘　　要：研究含有禁止转向限制的网络中,任意节点间最优路径问题。在Floyd算法基础上,通过引入正向和反向两种路径标记pij、qij,建立了一种禁行路径的判断规则,给出了一种适用的路径寻优迭代算法。在不改变网络的拓扑结构的情况下,该算法可同时获得所有任意两点间的最优路径。This paper resolves the optimal routing problem between two arbitrary nodes in general network,of which contains some direction-prohibited routes.On the basis of the Floyd algorithm and with the establishment of the restricted path judging rules,this paper introduces the path labeling p~ ,q~ ,which respectively label positive and reverse direction.No need to change the network topology circumstances,the path optimization between two arbitrary nodes is obtained by the iterative algorithm.

关 键 词：交通管制 禁行路线 最优路径 FLOYD算法 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]