Automated management system of vehicle management between the city

Abstract

The research is an algorithm for constructing an optimal route for each vehicle in a large city with a correction of the route under changing the road situation. Technically, the procedure for regulating of flows of vehicles is carried out through the dynamic interaction in real time between the central management traffic system (CMTS) and each vehicle that has set its initial and final coordinates.The CMTS sends to each driver voice commands along the route with the declared endpoint driver as with normal GPS navigation. The peculiarity is that the program analyzes the dynamic situation at each junction and throughout the city and, accordingly, sets the route taking into account the traffic situation for each particular moment of time. The ultimate goal of this study is to synchronize traffic flows, optimally use the transport arteries throughout the city, prevent congestion, and also track each vehicle to its destination in such a way that the time spent on the trip is minimal. To lay the optimal route, a Java program that implements the Dijkstra algorithm is used. An important condition for implementing this algorithm is the dynamism of the edges of the graph, which corresponds to the dynamic situation associated with urban traffic. In this regard, the weight of the edges of the graph modeling the transport network of the city varies according to the change in the traffic load between the adjacent intersections. Therefore, the database that stores traffic information for urban streets needs to be constantly updated. In our case, this update occurs every 10 seconds. This allows the program that manages traffic to quickly change the routes of vehicles, choosing the optimal.