Purpose. Often, the existing level of traffic capacity of road network facilities in large cities is insufficient. This is often due to the fact that urban growth is significantly ahead of the reconstruction and renovation of the corresponding infrastructure. As a result, traffic delays of various kinds occur on city roads, accompanied, first of all, by economic losses. Therefore, the search for reserves to reduce various types of losses associated with insufficient traffic capacity of the road network when organizing urban traffic is the purpose of this work. Methodology To determine the reserves for increasing the traffic capacity of the road network and reducing various kinds of delays, the method of deterministic analysis was used, the method for calculating the cycle according to F. Webster, based on the use of phase coefficients and time lost in the cycle (as the sum of transient intervals), the method for measuring the intensity of car traffic in the traffic flow, as well as the methodology for calculating economic losses arising from delays in the movement of vehicles. Findings. A study of delays and time expenditures and the corresponding economic losses that occur at typical objects of the city's street-road network (regulated intersections) has been carried out. The reserves of their reduction, and as a consequence, the increase in the capacity of both individual sections and the city's road network as a whole, have been determined. Originality. The use of this method on real objects of the road network allows developing the scientific interpretation of the methods used and expanding the scope of their application. Practical value. Assessment of emerging problems of traffic capacity and associated losses (including economic ones) makes it possible to determine the most promising ways to determine the traffic capacity reserves and, as a result, reduce economic losses.
Application of Mathematical Modeling Methods for Operational Optimization of Urban Traffic in an Accident on a Section of the Road Network
