We consider here a solvable task of finding the optimal strategy of moving a person between two specified points in a city using the selected types of urban public transport, which can be: bus, trolleybus, minibus, tram and subway (types of transport routes). At that, is minimized the time of moving a passenger between these points, taking into account possible restriction of the number of hislandings ondifferent transport vehicles. To solve these task is needed a database of roads network (DBRN1) and a database of routes network (DBRN2) for corresponding city.

     This task can be solved numerically by using the new science-intensive network technology called "Information technology of automation of control of discrete technological and information processes (in short — IT AC DTIP)", because optimizable process has all necessary properties for that. This process is discrete and is classified as a time-limited process. Its elements in terms of DTIP are:

• networks of city roads and routes — a network demand;
• used at this moment a transport vehicle or a passenger himself at walking — a device of service.