апропоновано алгоритм пошуку оптимального маршруту пасажирів у транспортній мережі міста методом відгалужень і меж.
The shortest path search algorithm in the public transport network is worked out taking into account time of transfers by a branch-and-bound method.
In this paper, the basic concepts of modeling of urban transport systems are analyzed.
The article is devoted to the methodology and research results of traffic flow parameters on the arterial streets, where different regimes of prioritizing urban public transport operate. The regularities of changes of such parameters make it possible to identify and differentiate the sections of transport network in terms of service efficiency, with the aim to implement various regulatory measures that would help to minimize delays in traffic flow.