engleski

Theory of graphs in traffic planning

The expansion of transport network through new arcs often influences the function of other arcstransprot routes. The problem consists in selecting from the set of feasible projects the subset which will reduce both costs: the cost of designing new communication i.e. arc and the cost of using the whole network. This paper presents the model that allows evaluation of the optimal choice very efficiently. The model includes a combination of mathematical and dynamical programming. Matematical programming is used to choose the best possible solution for a certain phase of network expansion. Dynamical programming techniques are used to carry out research from one phase to the other.

theory of graphs; traffic planning

nije evidentirano