In the paper the following task was studied.

A program solving the problem in case when time and dynamics are not considered was worked out and is presented. Furthermore it was tried to expand it onto case which includes time consideration. Here period of time *T* was divided to *s* time intervals *T* =**_{j}

*x*_{i}****_{j}) is defined as channel request number on *A*_{ i}* *during interval **_{j}, *r*_{i}**_{j}) as reject number on *A*_{ i}* *during interval **_{j}, *b*_{i }**_{j}) as busy channel number on *A*_{ i}* *at the beginning of **_{j}

*x*_{i} =* x*_{i}****_{j}) - total channel request number on *A*_{ i}

*r*_{i} =* r*_{i}****_{j}) - total reject number on *A*_{ i}

## M. K. Hasanov, N. E. Huseynov, M. A. Mammadov, J. M. Rasulov CHANNELS CONTROL SETTING IN TRANSFERRING SYSTEMS

It’s well known that for transferring, receiving and reprocession of different kind of increasing information in the network link, link setting – photon technology, which is one of the modern technologies, is used.

The photon technology is already applied to the different spheres of network link, link lines, settings of receiving and transferring, switch equipment and other settings.

In such settings for the photon flux control (optical rays) – direction choosing, switching, subscribes dispatching, channels transferring, different methods and elements are used. One of these elements are piezoelectromechanotron – optic conductors.

In the current work piezoelectromechanotron – optic channels control, analysis of other setting advantages and the method of investigation were shown. Basing on the method of work of piezoelectromechanotron – optic channel control, which was founded by us, piezoeffect and optic laws, the optimal variant of optical link channel control was chosen. On the basis of dynamic analogy methods and equivalent circuit, the mathematical model of piezoelectromechanotron – optic setting was assigned and installed. Besides it, the phsycomechanical characteristics of piezoelectromechanotron – optic settings were installed and the analysis of difference between the held experiment and the above-mentioned characteristics was done.

This newest setting may be widely used in the optical link system, computing systems and optical channels control system.

## M.A.Kokurina, Y.S.Fedosenko, A.V.Sheyanov ON BICRITERIAL OPTIMIZATION ALGORITHMS FOR INTERACTIVE MODELS OF PLANNING THE SERVICING OF OBJECTS FLOWS

Some problems in operative control of transport-technological processes in adequate mathematical production lead to extremal models of scheduling theory.

As example we can state empty tonnage dispatching for large-scale cargo processing device in regions of mass riverbed mining non-ore building materials on the rivers Kama, Belaya and upper Volga.

It is important that in the number of cases estimation of quality of management requires to model two criterions, taking into account accordingly such economic factors as working expenses and loss of potential profits. These criteria are independent and have linear form.

This report is devoted to consideration computing problems arising and to discussing the possible approaches to their solving.

1. Given flow Z = {z(1), z(2), …, z(n)} of objects to be serviced by processor P (single-stage processing). The objects servicing order is defined by schedule R nominated by decision-maker (DM). Processor can not service more one object simultaneously; service of each object is realized without interruptions.

The Object z(i) is characterized by integer parameters: – duration of service; – moment of arrival for servicing; ; , – linear coefficients of binary penalty Ш(R) = {ш_{1}(R), ш_{2}(R)} per time unit (servicing or waiting).

If on schedule R servicing the object z(i) is terminated at moment t_{+}(R, i), then penalty Ш(R) components are equal to ш_{1}(R) = a(i)(t_{+}(R, i) - t(i)), ш_{2}(R) = b(i)(t_{-}(R, i) - t(i)) respectively.

Basing on the general philosophy of bicriterial problems stating, there is possible several approaches to minimization of penalty Ш(R), among them are following.

1. Building in criterion plane {ш1(R), ш2(R)} full totality of efficient points with the possibility of syntheses corresponding Pareto-optimal schedule _{ }for any efficient point.

2. Reducing of bicriterial problem to unicriterial one with different variants of decision synthesis.

In case 1. solution can be received as a result of applying recurrence correlations, built on base of bicriterial analogue of dynamic programming principle, or by generalized to bicriterial case branch and bound method .

In case 2. there are such approaches: a) dedication of main criterion and solving problem of its minimization provided that values of other criterions do not exceed threshold values; b) lexicographic ordering of the criterions; second criterion minimization is possible only after solving of extremal problem on first criterion; c) realization procedures of consequent concessions as modification of method of lexicographic sequencing; g) convolution of vector criterion.

With all stated approaches computational difficulty of solving algorithms is exponential on n, because it is known that problem of optimum schedule synthesis is NP-hard even in unicriterial case.

The report presents results of analysis of representative collection of numeric experiments on solving stated extremal problem. The solution process uses an interactive technology as primary mode. Also we should notice that for number of transport applications considered model could lead to multycriterial generalizations.

**Share with your friends:**