基于网络限制的最短路模型  

Modeling for Shortest Path of Road Network with Restriction

作　　者：黄奇成[1] 王丽君[2] 苏醒[1] 

机构地区：[1]曲阜师范大学运筹与管理学院 [2]曲阜师范大学信息与传播学院,山东省日照市276826

出　　处：《曲阜师范大学学报（自然科学版）》2007年第1期51-53,共3页Journal of Qufu Normal University(Natural Science)

摘　　要：带限制的网络是一类特殊的网络,如具有禁止通行限制信息的交通路网.由于此类网络的最短路径的求解是有后效性的,因此经典的Dijkstra算法等就无法用来解决此类问题.提出了一种路网带限制的交通网络最短路径建模方法.该方法将具有禁行限制的特殊网络转化成一个一般的网络模型,从而可用任一传统高效的算法完成对其最短路径的求解.A road network with restriction is a kind of special networks, such as the traffic one with ban of passing. Because the shortest path problem for this kind of network is of after effect, the traditional algorithms cannt be used to find the shortest path, such as Dijkstra algorithm. The method of modeling for the shortest path problem of road network with restriction is discussed in this paper. By this method the network with restriction is trasformed into a common network model. Thus, the problem can be solved in any traditional and effective algorithms. A good way for solving this kind of problems are provided in the fields of traffic, communication, and so on.

关 键 词：路网限制 最短路径 交通路网 模型 

分 类 号：O157.6[理学—数学]