Modelling for shortest path in traffic network with node limits

A network with node limits 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 constrained, the traditional algorithms (such as Dijkstra's method) cannot be used to find the shortest path. The method of modelling for the shortest path problem in traffic network with node limits is discussed in this paper. By this method, the network model with limits is transformed into a common network model. Thus, the problem can be solved in any traditional algorithm. The complexity of the problem is essentially reduced. The paper provides a good way for solving this kind of problem in the fields of traffic, communication, and so on.