In this paper, we study routing in urban transport networks. Although urban transport networks are among dynamic networks, but using solutions that are available for static networks, the degree of complexity of these networks can be reduced. There are various algorithms for network analysis that we can use in this regard.
Amongst these algorithms, Dijkstra is the most popular one, which has several types, including algorithms A and B.
The most important problem with the analysis of urban transport networks is the problem of entering traffic information into the algorithm’s analyzer program because traffic information is constantly changing. Different parameters are effective in traffic, and we can not provide a reliable and effective model for urban transport networks due to the unpredictable nature of many of these parameters.
In this paper, using the Java programming language in the Internet, a novel and innovative solution is presented to find the best route in urban transport networks.