'Czech Technical University in Prague - Central Library'
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
