2. Statement of the solvable task
Here we use the following notations:
- DBRN1 — database of roads network;
- DBRN2 — database of routes network;
- TP — a target point.
Given:
- DBRN1 and DBRN2 for required city;
- usable types of transport routes;
- addresses and position of initial and final TPs on the roads network;
- speed of a passenger's walking;
- permissible number of a passenger's landings on different routes (optional parameter);
- minimum allowable time of a passenger's passage between two adjacent nodes of the routes network (system restriction).
Minimized quality criterion: average time of delivery of a passenger from the initial TP to the final TP using selected types of transport under the possible restriction of the number of a passenger's landings on different routes.
