On a problem of transport routing for urban transport networks

Abstract

The work of the transport routing control system is considered, a review of theoretical routing for information networks is carried out. A description of algorithms for finding the shortest paths on graphs is given. The concept of vehicle routing control for urban networks is presented. It is shown that the urban transport network can be represented in the form of a graph and the theory and methods on routing in information networks can be transferred to transport networks. Splitting the transport routing control problem into two parts: static and dynamic. The management of the routing of transport in the city’s transport fences is even more similar to the routing of computer traffic in the information fences. The main points of view are in that, in the first place in the quality of the package, the transport service is visible, as well as to understand the rules of the road collapse, how to surround the oversupplied packages. At the same hour, the transport routing is organized, everything will be stored in the most common problems of the best way between two universities. If an adaptive routing control algorithm is developed for centralization, since it allows the reduction of expenses, there is no need to equip the add-on reception-transmission with processors of great effort. It is also necessary to provide a connection when exchanging information from an attachment to receive-transmissions and from a central server. However, the speed of the vehicle is less than the widening of the electronic signal, so it is possible to eliminate the inappropriateness by placing the attachments of the reception-transmission in a specific rank. If we consider the urban transport network in the form of a graph, then there is a problem associated with the large size of the system. The computational task can be facilitated by dividing the city network into smaller segments connected by single nodes. That is, such nodes that can not be a minute when moving from one point of the city to another. With such a breakdown, the shortest paths will not change, because the principle of optimality will work here.