Formulation of optimisation task for cargo transport in established regroup relations

The following paper is connected to the formulation of the task for traffic flow optimisation in the examined part of transport network for a criterion of equal average costs. It is assumed that transport network is presented in a form of a graph. The arcs of a graph have interpretation of paths connections, vertices of a graph have interpretation of locations. On paths connections, the capacity function interpretation has been defined. Based on information mentioned above, the optimization task of determining the equipment regrouping relations is formulated. First of all, assumptions on displacement of vehicles in a given network in a regroup relation were defined. What is more, criteria of vehicles flows in regroup relations in a transport network were formulated and then optimizing tasks for vehicles flow were defined: the first optimization task of vehicles flow with average cost criterion and the second one: optimization task of vehicles flow with cost criterion