The article analyses the problem of further development of geographic informational systems with traffic monitoring channel (GIS‐TMC) in order to present the road users with effective information about the fastest (the shortest in respect of time) routes and thus to improve the use of existing city transport infrastructure. To solve this task it is suggested to create dynamic (automatically updated in real time) street passing duration base, for support of which a city transport monitoring system operating in real time is necessary, consisting of a network of sensors, a data collection communications system and a data processing system. In the article it is shown that to predict the street passing duration it is enough to measure speed of transport in the characteristic points of the street. Measurements of traffic density do not significantly improve accuracy of forecasting the street passing time. Analytical formulas are presented meant to forecast the street passing time.

The problem of the correction of the disorganized train traffic schedule is analyzed (aiming to minimize general costs related to the expenditure of energy and time wasted by people and equipment). Disorganized a train traffic is named an event when you should insert one more train route in the already created train traffic schedule. This problem can be solved applying the algorithms for the search of the shortest chain The fuzzy algorithm for the determination of the shortest chain, the key operators and their specific features are also analyzed.

The article analyses the problem of train traffic schedule optimal addition according to minimum overall expenditure criteria. The task is to analyze optimal insertion of an additional train track into already made schedule. The methodology is all‐right applicable for ad hoc requests submission. Handling importance of ad hoc requests is emphasized in EU directive 2001/14/EB. The task can be solved applying Monte‐Carlo, genetic algorithms, variants reselection methods or methods of the shortest (according to waste) way in graphs. All these methods are equally exact and can be implemented in modern computers with short enough time consumption.