Determining the Permeable Efficiency of Elements in Transport Networks

V. Svoboda, D. Šiktancová

Abstract


The transport network is simulated by a directed graph. Its edges are evaluated by length (in linear units or time units), by permeability and by the cost of driving through in a transport unit. Its peaks (nodes) are evaluated in terms of permeability, the time of driving through the node in time units and the cost of driving a transport unit (set) through this node.For such a conception of the transport network a role of optimisation and disintegration of transport flow was formulated, defined by a number of transport units (transport sets). These units enter the network at the initial node and exit the network (or vanish at the defined node). The aim of optimization was to disintegrate the transport flow so that the permeability was not exceeded in any element of the network (edge, nod), so that the relocation of the defined transport flow was completed in a prearranged time and so that the cost of driving through the transport net between the entry and exit knots was minimal.

Keywords


the transport networks; elements; disintegration of transport flow; permeability of elements in transport network; permeability of networks; determining of the permeability of edges; deterministic and stochastic work regimes; systems of queuing theory; a

Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 1210-2709 (Print)
ISSN 1805-2363 (Online)
Published by the Czech Technical University in Prague