计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (23): 59-62.DOI: 10.3778/j.issn.1002-8331.2009.23.017

• 研究、探讨 • 上一篇    下一篇

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

范昌胜1,郭 强1,岳爱峰2   

  1. 1.西北工业大学 理学院 应用数学系,西安 710129
    2.山东师范大学 图书馆,济南 250014
  • 收稿日期:2008-04-29 修回日期:2008-07-30 出版日期:2009-08-11 发布日期:2009-08-11
  • 通讯作者: 范昌胜

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

FAN Chang-sheng1,GUO Qiang1,YUE Ai-feng2   

  1. 1.Department of Applied Mathematics,School of Science,Northwestern Polytechnical University,Xi’an 710129,China
    2.Shandong Normal University Library,Jinan 250014,China
  • Received:2008-04-29 Revised:2008-07-30 Online:2009-08-11 Published:2009-08-11
  • Contact: FAN Chang-sheng

摘要: 研究含有禁止转向限制的网络中,任意节点间最优路径问题。在Floyd算法基础上,通过引入正向和反向两种路径标记 pij、qij,建立了一种禁行路径的判断规则,给出了一种适用的路径寻优迭代算法。在不改变网络的拓扑结构的情况下,该算法可同时获得所有任意两点间的最优路径。

关键词: 交通管制, 禁行路线, 最优路径, Floyd算法

Abstract: 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 pij ,qij ,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.

Key words: traffic control, restricted routes, optimal path, Floyd algorithm

中图分类号: