Next Article in Journal
Inverter Volt-Ampere Capacity Reduction by Optimization of the Traction Synchronous Homopolar Motor
Next Article in Special Issue
Implicit Solitary Waves for One of the Generalized Nonlinear Schrödinger Equations
Previous Article in Journal
Fault-Tolerance by Resilient State Transition for Collaborative Cyber-Physical Systems
Previous Article in Special Issue
The Exact Solutions of Stochastic Fractional-Space Kuramoto-Sivashinsky Equation by Using (GG)-Expansion Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multicriteria Optimization of a Dynamic System by Methods of the Theories of Similarity and Criteria Importance

by
Sergey Misyurin
1,2,*,†,
German Kreynin
1,†,
Andrey Nelyubin
1,† and
Natalia Nosova
1,*,†
1
Blagonravov Mechanical Engineering Research Institute of the Russian Academy of Sciences, 4 Mal. Kharitonyevskiy Pereulok, 101990 Moscow, Russia
2
Moscow Engineering Physics Institute, National Research Nuclear University MEPhI, 31 Kashirskoe Shosse, 115409 Moscow, Russia
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Submission received: 20 October 2021 / Revised: 7 November 2021 / Accepted: 8 November 2021 / Published: 11 November 2021

Abstract

:
The problem of multicriteria optimization of a dynamic model is solved using the methods of the similarity theory and the criteria importance theory. The authors propose the original model of a positional system with two hydraulic actuators, synchronously moving a heavy object with a given accuracy. In order to reduce the number of optimizing parameters, the mathematical model of the system is presented in a dimensionless form. Three dimensionless optimization criteria that characterize the accuracy, size, and quality of the dynamic positioning process are considered. It is shown that the application of the criteria importance method significantly reduces the Pareto set (the set of the best solutions). This opens up the possibility of reducing many optimal solutions to one solution, which greatly facilitates the choice of parameters when designing a mechanical object.

1. Introduction

Artificial intelligence is now widely used in industry, applied to transporting mechanisms, such as robots and manipulators, which move and deliver various objects to specified positions. In simple loading systems, the accuracy of moving and positioning of goods can be relatively low, which makes it possible to use relatively simple devices in these cases. However, feeding a tool in processing machines requires a sufficiently high accuracy. The movement of robots can be carried out by various actuators: pneumatic, hydraulic, electric, etc.
Positioning control problems in transporting mechanisms (robots) are solved mainly in two ways: using special type regulators, such as based on fuzzy logic, neural networks, and so on or the ordinary regulators with feedback control of various type. The mathematical models of actuators, as a rule, have a rather complex structure, consisting of higher-order differential and algebraic equations.
Developing new devices requires the solving of a number of technical problems associated with the choice of their type, structure, and control system, satisfied to many requirements. In mechanical systems, hydraulic actuators are widely used. Their main advantage in relation to pneumatic and electric actuators is their high carrying capacity and low sensitivity to the load variation [1].
Mathematical models of hydraulic actuators and their control systems are well studied and fully presented in works, such as [2,3,4,5]. However, the problem of finding the best constructive solution in most cases is based of the original models not reduced to a dimensionless form. Due to the abundance of differently sized variables, the general patterns of the results obtained are often not visible, it is difficult to single out the groups of criteria to be optimized. Additionally, it is not advisable to optimize un-grouped parameters (variables) at the same time. This was noted by example in [6].
In [7], the authors turn to dimensionless models, but do not use them systematically in the search for the best solution. In this case, the dimensionless model serves only to partially simplify the general formulation of the problem and to study the properties of the original model. The transition to dimensionless parameters was used to select a special object positioning control system, which should provide an approach to a given position simultaneously with zero speed and zero acceleration in order to avoid damage to the contact point when stopping.
The principle and process of transition to dimensionless forms have been developed for a long time. Here we can note the fundamental works in this area [8,9]. The importance of the theory of similarity and analogy in understanding the essence of things was noted back in the days of Plato. In a number of philosophical works, attempts have been made to generalize approaches to equivalence in different fields of knowledge, which gives this direction additional significance. In [10], a general metric of transition to dimensionless variables was considered and introduced, but it was noted that there is no uniquely best measure of dynamic similarity, since the feasibility of any given measure depends on its intended use.
In [11], it is shown that, due to the complexity of the mathematical description of technical dynamic systems, when choosing their structure and parameters, they usually turn to very laborious interactive (dialogue) procedures. A number of tools help to avoid direct enumeration of options when using such procedures, among which the methods of dimension and similarity theory take a significant place. These methods are based on the use of dimensionless complexes of physical parameters of the system (criteria of similarity and the relationship between them) together with the translation of the mathematical description of the system into a dimensionless form [12,13]. As a result, additional opportunities open up for identifying general patterns of dynamic processes, which greatly facilitates making the final decision.
Experience shows that each specific problem of the dynamics of a mechanical system requires a special approach to the formation of a dimensionless model and similarity criteria. The structure and form of the dimensionless model depends on the accepted units of measurement of the variables included in the equations of the model, and on the expressions attached to its coefficients. These factors are initially unknown and are usually formed according to the intuition and experience of the researcher, which introduces uncertainty in the process of transition to a dimensionless model and does not guarantee high efficiency of its use. The approach proposed below to the formation of dimensionless models of a dynamic system of a hydraulic actuator is a development of the procedure started in [11].
This paper illustrates an example of finding the optimal solution for a positional system with two hydraulic actuators. This type of actuator was chosen based on the task of controlled movement of a heavy and bulky object (load). The hydraulic actuator has the highest power density. However, the presence of two actuators creates special problems in control, since the drives must operate in coordination in both position and speed. Based on this, the authors proposed an original control scheme that solves this problem based on the use of only two valves (Figure 1): one of them regulates the average speed of the moving object, and the other controls the distribution of fluid flows directed into the cavities of the hydraulic cylinders [14,15].
The study of the mathematical model is carried out in dimensionless parameters, the transition to which hydraulic actuator systems are presented in [6]. Parametric synthesis is carried out according to the principle of multicriteria optimization. During the transition of the system to a dimensionless form, three optimization criteria are identified with further application of the criteria importance method. The criteria importance method significantly reduces the optimal solutions of the system, which facilitates the selection of the best solution when designing a mechanical object.
The parametric synthesis of a mechanical system consists in choosing the values of the parameters that make up the vector X = ( x 1 , x 2 , , x n ) that provide the best values of the characteristics (performance indicators) of the system that make up the vector K = ( k 1 , k 2 , , k m ) . Thus, the problem of multicriteria (multi-objective) optimization is posed, in which X is a vector of variables, and K ( X ) is a vector of criteria (objective functions).
To solve this problem, it is necessary to develop an adequate mathematical model of the system under consideration, using the vector X as input parameters and calculating the values of the characteristics K ( X ) at the output. Further, it is necessary to implement a method for solving the optimization problem. In addition, in the presence of several characteristics ( m > 1 ), it is required to take into account the dependencies and preferences between them.
Complex mechanical systems usually contain up to several tens of parameters n and several characteristics m. At the same time, mathematical models of dynamic systems contain complex connections and differential equations, and for calculations they require the use of numerical methods. Therefore, when solving the problem of optimizing such complex systems, the computational model usually represents a “black box”, which makes it practically impossible to use local, gradient optimization methods [16,17]. Among the global optimization methods working with such complex models, genetic algorithms [18], and other variations of evolutionary algorithms, particle swarm optimization [19], and simulated annealing methods [20]. In this paper, for the global search for optimal solutions, the parameter space investigation method [21] is used, based on the construction of sequences of points uniformly distributed in the feasible area of the parameters X space [22].
In multicriteria optimization problems, as a rule, it is not possible to obtain a feasible solution that is best at once according to all criteria. Using formal mathematical and numerical methods, a set of Pareto optimal solutions can be obtained (approximated). To select the one best solution among them, it is necessary to involve additional information about the preferences regarding these criteria.
There are a priori and a posteriori methods for solving multicriteria optimization problems. In a priori methods, the question of preferences is resolved before the search for solutions is carried out. These methods include the method of identifying the “main” criterion, as well as various methods of convolution of the criteria into one aggregated performance indicator. For example, the weighted sum F ( X ) = i = 1 m w i k i ( X ) , the product F ( X ) = i = 1 m k i w 1 ( X ) , or the Germeier convolution F G ( X ) = m i n i k i ( X ) / w i . Before convoluting, the criteria k i are normalized in a special way. This approach allows one to go straight to solving the optimization problem with one objective function. However, there are a number of disadvantages behind the simplicity of this approach. First of all, it is difficult for a person, no matter how expert he or she is, to set the exact values of the weights reflecting the relative importance of the criteria. In addition, there are a number of theoretical problems associated with the justification of this approach [23].
On the contrary, in a posteriori methods, optimization is performed first taking into account all the criteria, and then preferences are analyzed. Analysis of the set of obtained solutions is itself useful in solving such problems. First of all, a person, an expert working with such data of optimization results, understands the possibilities available to him or her: evaluates the areas of feasible solutions, the ranges of change in the values of the criteria. In such an analysis, visualization tools [24], and interactive interaction of an expert with a computer analytical system [25] play an important role. The more adequately the expert’s real preferences are revealed, the better the solution obtained on their basis will be. The preferences are most accurately established in the process of dialogue with the analytical system, during which a person sees intermediate solutions, obtains a clearer idea of the real conditions of the problem, resource opportunities, and goals. One of the most important properties of such systems is the ability to provide explanations (justifications) of the results and conclusions obtained, interpreting them in terms of the subject area, in a language understandable for an expert [26].
It is known that the best solution should be chosen among the set of Pareto optimal ones. However, this set of solutions is usually quite large. To narrow the scope of choice, additional assumptions should be made about the preferences of experts regarding the importance and values of the criteria. For formal modeling of these preferences and obtaining conclusions on the basis of this information, the approach of the mathematical theory of criteria importance was used in this work [27,28]. This method assumes a consistent refinement of information about preferences. First, the simplest information about ordering criteria by importance is found out. Such qualitative information is easier to obtain than quantitative estimates of importance, and, therefore, more reliably describes the expert’s real preferences. Next, the formal methods of the theory come into play, which make it possible to reasonably discard from consideration some of the solutions from the Pareto set, thereby narrowing the set of choices for the best solution. Then, if necessary, quantitative estimates of importance are also used, but not accurate, just in the form of intervals. Additionally, additional information about changing preferences along the criteria scale can be used.

2. Statement of the Problem and Mathematical Model of the System

The object of research in this work is a rather complex manipulator designed to lift a heavy, bulky load using two parallel and synchronously operating hydraulic actuators 1 and 2 (Figure 1). Let us describe the mathematical model of the object. The moving object has a mass m = m 1 + m 2 , where m 1 , 2 are the mass loads applied to the actuators. The main working cavities are the lower cavities of the actuators; however, if necessary, the upper cavities can also be used (for example, when lowering an object). The law of motion is mainly determined by the pressures in the lower cavities, which are connected through the control valve 3, the intermediate cavity 4 (volume V) and the control valve 5 when the object is lifted to the power source (with pressure p M ), and when the object is lowered, to the drain line (with pressure p A , usually equal to atmospheric). The ratios between the effective flow area of the valve 5 and the effective flow areas of the valve channels 3 leading to the cavities of the actuators are established depending on the formulation of the problem.
The equations of movement are:
m i x ¨ i = p i F + m i g k i x ˙ i + P L i , i = 1 , 2 ;
where x is the piston displacement; p i are pressures in the lower cavities; F is the effective piston area; m i g , P L i are weight and force load on the rod, respectively; k i are coefficients of fluid friction in the actuator.
The changes of the pressure p i in the lower cavities of the actuators and the pressure p in the intermediate cavity are related by dependencies:
p ˙ = W β s i g n ( Δ p ) | Δ p | β 1 α 1 s i g n ( Δ p 1 ) | Δ p 1 | β 2 α 2 s i g n ( Δ p 2 ) | Δ p 2 | , p i ˙ = W i β i α i s i g n ( Δ p i ) | Δ p i | x i ˙ ,
where W = E f F x v 2 p M ρ , W i = E f F ( x 0 i + x i ) 2 p M ρ ; Δ p = p M p (when lifting) or Δ p = p A p (when lowering) of the object, Δ p i = p p i ; β , β 1 and β 2 are channel opening degrees f, f 1 and f 2 ; E is the bulk modulus of the working fluid; x v is the length of the intermediate cavity; ρ is working fluid density.

3. Transformation of the Model into a Dimensionless Form

According to the method of the similarity theory [8] Equations (1) and (2) are transformed into a dimensionless form by replacing variables with their dimensionless analogs λ , τ , σ , according to the relations x = q 1 λ , t = q 2 τ , p = q 3 σ . As a result of this replacement, as well as m i = c i m (where i = 1 , 2 ), ε = E / q 3 and simple transformations, we obtain a transformed system (3) and a system of Equation (4) of relations between the coefficients A i of the system (3) and q j .
c i A 1 λ ¨ i = σ i c i A 3 A 4 λ ˙ i A 6 , σ ˙ = A 5 β s i g n ( Δ σ ) | Δ σ | β 1 α 1 s i g n ( Δ σ 1 ) | Δ σ 1 | β 2 α 2 s i g n ( Δ σ 2 ) | Δ σ 2 | , σ ˙ i = ε λ 0 i + λ β i α i s i g n ( Δ σ i ) | Δ σ i | A 2 λ ˙ i ,
A 1 = m q 1 q 2 2 q 3 F ; A 2 = q 1 q 2 U ; A 3 = m g q 3 F ; A 4 = k i q 1 q 1 q 2 F ; A 5 = ε λ V ; A 6 = P L i q 3 F .
where λ , τ , σ are dimensionless analogs of displacement, time and pressure in cavity 4, respectively; σ 1 , σ 2 are dimensionless analogs of pressure in cavities 1 and 2.
The system (4) includes six so far unknown coefficients A i and three, also so far unknown, scale factors q j . This allows us to set three arbitrary values A i , put, for example, A 1 = A 2 = 1 and A 3 = m g / p M F . From these conditions it is possible to determine q j , as well as three unknown coefficients A 4 , A 5 , A 6 :
q 1 = m U 2 p M F ; q 2 = m U p M F ; q 3 = p M ; A 4 = k i U p M F ; A 5 = ε λ V ; A 6 = P L i p M F ,
where U = ( f / F ) 2 p M ρ is the maximum achievable piston speed in the actuator with parameters f, F, p M ; ε = E / p M is the dimensionless analogue of the bulk modulus of liquid.
The final transformed model of the drive system presented below is obtained by optimizing the conversion factors:
c i λ ¨ i = σ i + c i χ L κ i λ i ˙ + χ L i , σ ˙ = K V β s i g n ( Δ σ ) | Δ σ | β 1 α 1 s i g n ( Δ σ 1 ) | Δ σ 1 | β 2 α 2 s i g n ( Δ σ 2 ) | Δ σ 2 | , σ ˙ i = ε λ 0 i + λ β i α i s i g n ( Δ σ i ) | Δ σ i | λ ˙ i ,
where χ L = m g / p M F ; χ L i = P L i / p M F ; K V = A 5 and λ 0 i = x 0 i / q i are the reduced initial volumes of working cavities of actuators.
The system (6) includes dimensionless parameters that are convenient to use in the optimization process by choosing them as parameters:
K V —intermediate cavity stiffness;
λ 0 i —stiffness of the actuators at the initial moment of movement;
χ L —manipulator total mass load;
c i —distributions of the total load between the actuators, additional resistance forces χ L i , which can be present in the system both continuously and acting discretely;
κ i = k i U p M F —liquid friction forces;
α i = f i / f —the ratios between the dimensions of the flow areas of the channels of valves 3 and 5.
Note that λ e = 0.5 ( 1 c o s ( ω τ ) ) is assumed to be a given basic law of motion of the manipulator from the initial position λ 0 = 0 to the final position λ e = 1 ; ω = π / τ S is the conditional frequency characterizes the dimensionless time of the process τ S . The opening of the valve channel 3 is characterized by the expression:
β = ϑ 1 λ e λ 1 + ϑ 2 λ ˙ e λ ˙ 1 .
When the manipulator is operating at very low speeds, the law (7) can be replaced by the law of uniform motion, i.e., β = 1 is accepted. We will take into account the effect of the control system delay by replacing β in expression (7) by γ , where γ is the signal coming from the control system. The quantity β is determined from the first-order equation:
β ˙ = 1 τ A ( γ β ) ,
where τ A is the control system time constant.
If the flow areas of all channels are equal f 1 = f 2 = f , the mean position of the valve shutter 3 corresponds to the coordinates β 1 = β 2 = 0.5 that can be taken as the initial ones.
As the control law for valve 3, we take the simplest linear law, written, for example, relative to the first actuator β 1 = 0.5 ϑ 11 ( λ 1 λ 2 ) ; then β 2 = 0.5 + β 1 .
We will take into account the effect of the delay of the valve control system (3) by replacing in the law β 1 with γ 1 , where γ 1 is the signal coming from the control system, with the definition β 1 from the equation β 1 , where β 1 ˙ = ( 1 / τ B ) ( γ β ) , where τ B is the time constant of the valve control system (3).

4. The Optimization Problem

As mentioned earlier, after the transition to dimensionless parameters, three indicators ( K 1 , K 2 and K 3 ) were taken as the main criteria for optimality (objective functions) of the system, which characterize the values, respectively, of the imbalance of mass loads on actuators, power (size) of actuators and the maximum divergence of displacements of their rods (deviation from synchronicity) in the process of movement.
K 1 = | 0.5 c 1 | , K 2 = m g p M F = χ L , K 3 = Δ λ m a x , where Δ λ = | λ 1 λ 2 | .
The first criterion shows that the greater its value, the greater the difference in the loads on the actuators the manipulator allows, the second characterizes the dimensions of the actuator (the higher the value of K 2 , the smaller the dimensions of the actuator), an important criterion for volumetric and mass indicators. The third criterion is responsible for the synchronization of the movement of the two actuators, i.e., the smaller it is, the more uniformly (synchronously) the actuators move.
These criteria are contradictory, i.e., in the process of searching for feasible solutions in this problem, it is not possible to obtain one solution, the best one by all three criteria at the same time, and it is possible to single out a set of Pareto optimal solutions. For calculations and visualization of many solutions, a unique software MOVI was used, developed with the participation of the authors of this publication. Table 1 shows the optimized parameters of the system and the ranges of their values.
The load parameter c 1 is special and needs to be explained. The fact is that the imbalance of the loads c 1 and c 2 = 1 c 1 characterizes a specific load, and not the design of the optimized manipulator. When designing a manipulator, we do not know in advance the load parameters and cannot optimize them. However, the maximum permissible imbalance of the loads c 1 and c 2 can already be considered a characteristic of the manipulator, which can be optimized.
Let us consider in more detail how the criteria depend on the parameter c 1 . The criterion K 1 depends on c 1 explicitly: the greater the load imbalance, the better. However, K 1 values greater than 0.2 are not required in practice. Therefore, in this problem, the values of c 1 vary from 0.3 to 0.7.
The criterion K 2 does not depend on c 1 at all. A typical example of the dependence of the criterion K 3 on c 1 is shown in Figure 2.
With an increase in the load imbalance, the synchronization of the actuators monotonically deteriorates, and asymmetrically when c1 deviates from 0.5 to the lower or higher side. However, starting from certain values of c 1 , this dependence is violated, and the graph begins to behave unpredictably. In Figure 2 these points are circled in red. Solutions outside these c 1 values will be considered unacceptable. To detect such cases, for each checked value of c 1 , we will perform several additional calculations with the load c 1 up to 0.5.
Additionally, it is necessary to take into account the asymmetry of the dependence of K 3 on c 1 . For every feasible solution we obtain, the ultimate allowable load will be either less or greater than 0.5. For a symmetric case of unbalanced loads, the values of the criteria K 1 and K 2 will be the same, but the value of the criterion K 3 may be worse. However, we can switch this manipulator to a more advantageous (from the point of view of K 3 ) mode ( c 1 > c 2 or c 1 < c 2 ), depending on how the load lies. Therefore, this asymmetry is not a problem.

5. Generation of Alternative Solutions and Initial Analysis

In the software MOVI, 4000 alternative solutions were generated, the coordinates of which are uniformly distributed in the space of variable parameters [20,21]. Of these solutions, 2198 were found to be feasible in relation to the constraints of the model. Among the feasible solutions, there were 96 Pareto optimal solutions. Each solution x can be associated with a three-dimensional vector K ( x ) = K 1 ( x ) , K 2 ( x ) , K 3 ( x ) , the components of which are estimates by three criteria. If the solutions are depicted as points in the three-dimensional space of criteria, then they form a cloud in a certain area, and the points of Pareto optimal solutions will be located on a part of the boundary of this cloud. In Figure 3 is shown how the projections of the cloud from the points of feasible solutions to the two-dimensional spaces of criteria are distributed. Blue rhombuses denote admissible solutions, green circles-Pareto optimal ones.
The depiction of the set of solutions in Figure 3 represent the initial, primary information for subsequent analysis and selection of the best solution. At the first stage, such images make it possible to assess in what ranges of criteria values are feasible solutions. That is, in fact, the decision maker (expert) receives primary information about the available opportunities in terms of achieving the best values of the criteria.
The first practical conclusion based on the analysis of Figure 3 is the following: a lot of feasible solutions are obtained with an acceptable value of the load imbalance K 1 . Therefore, we can safely discard some of the solutions with weakly acceptable values of K 1 , imposing an additional constraint on the feasibility of the solution K 1 > 0.1 , and this leaves quite a lot of feasible solutions—821. Of these, 45 are Pareto optimal solutions. The values of the criteria for these 45 options are shown below in Table 2. The result of imposing this restriction in the criteria space is shown in Figure 4.
We see that in the projections onto K 1 and K 2 (Figure 4a,b), the set of solutions is expectedly divided into feasible (to the right of the line K 1 = 0.1 ) and infeasible (to the left of the line K 1 = 0.1 ). Its analysis helps to verify, to make sure that the imposed constraint on the criterion K 1 led to acceptable impairments in the remaining criteria.
Further, you can also impose constraints on the remaining criteria, and then gradually increase these constraints, thereby narrowing the set of choices. This is one of the approaches, it can be classified as intuitive, informal. Its application becomes much more complicated with a larger number of criteria. To solve the problem of choosing the best solution in this work, we will apply the formal approach developed in the criteria importance theory.

6. Solving the Choice Problem by the Method of the Criteria Importance Theory

It is required to choose the best solution among the selected 45 solutions obtained at the previous stage, taking into account the constraint K 1 > 0.1 .
To apply the methods of the criteria importance theory, the individual criteria K 1 , K 2 , K 3 must be brought to a homogeneous form with a common scale Z, which can be just ordinal [26]. In this problem, we will use a 10-point scale: the higher the score, the better, the higher the value (usefulness, preference) for the decision maker of such values according to the criterion. To bring the criteria to the 10-point scale Z, we use linear normalization of the criteria values and rounding. As a result, each of the 45 alternative solutions is associated with its vector score from the set Z 3 = Z × Z × Z . The values of the initial criteria and the obtained vector scores y = ( y 1 , y 2 , y 3 ) for all 45 options are given in Table 2. It should be noted that the requirements for minimization and maximization for the initial criteria can be different ( K 1 m a x , K 2 m a x , K 3 m i n ), while the scores on the scale Z are always the same ( y 1 m a x , y 2 m a x , y 3 m a x ).
In fact, due to rounding, each vector score describes a certain small region in the original 3D space of the criteria. At the same time, some solutions may be in the same region, and then they will have the same vector score. For example, alternatives 307 and 1734 have the same vector score (9, 8, 8). Further, using the method of the criteria importance theory, we will solve the problem of choosing the best vector score. Choosing this vector score, we will obtain a corresponding small region in the original space of criteria, which includes one or more solutions from the 45 considered.
In the criteria importance theory, the preferences of decision makers are modeled using binary relations [26]. The non-strict preference relation R of the decision maker is introduced on the set of vector scores Z 3 : the notation y R z means that the vector score y is no less preferable than z. The relation R is reflexive and transitive, it generates the relations of indifference (equivalence) I and strict preference (dominance) P:
y I z y R z and z R y , y P z y R z , but z R y is not true .
It is known that if the relation R is complete, then on a finite set of vector scores there is at least one optimal vector score y, such that y R z holds for all other vector scores z. There can be several optimal vector scores equivalent by the relation I. In this case, the choice of the best vector score should be carried out among the optimal vector scores.
If the relation R is incomplete, then the best vector score should be chosen among the non-dominated vector scores. A vector score y is called non-dominated with respect to P if there is no other vector score z, such that z P y holds.
Since the decision maker’s preferences increase along the scale of criteria Z, the Pareto relation is defined on the set of vector scores Z 3 :
y R z y i z i , i = 1 , 2 , 3 ; y P z y R z and y z .
Among the 45 vector scores under consideration, there are 10 non-dominated with respect to the Pareto relation P . In fact, 9 vector scores remain, since variants with numbers 307 and 1734 have the same vector score (9, 8, 8). These vector scores and the corresponding alternatives are shown in Table 3.
At the next step of solving the choice problem by the criteria importance method, we enter information Ω about the ordering of criteria by importance into the software DASS, as shown in Figure 5 [27,29]. The criterion K 1 is more important than the criterion K 2 ( 1 2 ) , and the criterion K 2 , in turn, is more important than the criterion K 3 ( 2 3 ) .
As a result, there are only 4 non-dominated vector scores and the corresponding 5 alternative solutions shown in Table 4. For each of the 5 vector scores that turned out to be dominated with respect to P Ω , it is possible to formally explain why it should be excluded from consideration. Namely, what other vector score dominates it and on the basis of what information about preferences this conclusion is made:
y ( 307 ) = ( 9 , 8 , 8 ) P 1 2 ( 8 , 9 , 8 ) P ( 8 , 9 , 7 ) = y ( 442 ) , y ( 2478 ) = ( 10 , 7 , 10 ) P 1 2 ( 7 , 10 , 10 ) P ( 5 , 9 , 10 ) = y ( 1080 ) , y ( 2478 ) = ( 10 , 7 , 10 ) P 1 2 ( 7 , 10 , 10 ) P ( 1 , 10 , 10 ) = y ( 1246 ) , y ( 2478 ) = ( 10 , 7 , 10 ) P 1 2 ( 7 , 10 , 10 ) P ( 7 , 9 , 9 ) = y ( 1615 ) , y ( 2478 ) = ( 10 , 7 , 10 ) P 1 2 ( 7 , 10 , 10 ) P ( 3 , 10 , 7 ) = y ( 3005 ) ,
For example, the notation (10, 7, 10) P 1 2 (7, 10, 10) means that the vector score (10, 7, 10) is preferable to the vector score (7, 10, 10), since the first criterion is more important than the second. As we can see from the constructed chains of vector scores, in this case, in order to discard the vector scores dominated by P Ω from the information Ω about the ordering of criteria by importance, it turned out to be enough to use only the fact that the first criterion is more important than the second.
The resulting 4 vector scores remain incomparable with the introduced information about the DM’s preferences. Next, we will analyze them from different angles. At this stage, the value functions of these vector scores can be estimated by calculating the centroid values of the decision maker’s preference parameters [28]. Figure 6 shows how to do this in the software DASS, Table 4 shows the resulting values of the value functions.
Let us continue the formal solution of the choice problem by the criteria importance method. At the next step, we input in the software DASS (see Figure 7) interval information about the relative importance of the criteria: the first criterion is at least 2 times more important than the second, and no more than 4 times; the second criterion is no more than 2 times more important than the third.
With such information about the preferences of the decision maker, the vector score y ( 1267 ) = ( 8 , 8 , 10 ) turns out to be dominated. Table 5 shows the remaining non-dominated vector scores. Their value functions have changed slightly, as the set of possible values of preference parameters has changed (narrowed) and the corresponding centroid values of these parameters have shifted.
At the next step in solving the choice problem, let us clarify the information on how the decision maker’s preferences grow along the criterion scale Z (see Figure 8).
As a result, there is only one non-dominated vector score (10, 7, 10), which corresponds to the solution 2478. Additionally, in favor of this vector score, we can note the fact that the estimation of its value function was higher than others at each step of solving the problem.
The only solution was selected using imprecise information about the preferences of experts, given in the form of interval estimates. In the previous steps, the choice set was significantly narrowed down based only on qualitative assessments of preferences. The use of partial and imprecise information about the preferences, an iterative procedure for clarifying this information, as well as the ability to formally substantiate the conclusions made are significant advantages of the considered method of the criteria importance theory in comparison with other methods of multicriteria analysis.

7. Additional Visual Analysis of Alternative Solutions

After the formal analysis of the problem by the criteria importance methods, it is useful to return to the graphical representations of the solutions. Consider 4 non-dominated vector estimates and the corresponding 5 solutions listed in Table 4. Recall that they are selected after a simple ordering of the criteria by importance.
Let us see where these solutions are in the space of the initial criteria K 1 , K 2 , K 3 . To do this, we introduce additional constraints on the values of criteria in the software MOVI. Note that the considered vector scores have the minimum values of the components y 1 , y 2 , y 3 equal to 8, 7, 7, respectively. In order for only solutions with estimates y 1 8 , y 2 7 , and y 3 7 to remain feasible, the following constraints should be imposed on the values of the criteria: K 1 > 0.17 , K 2 > 1.188 , and K 3 < 0.0081 . The result is shown in Figure 9.
Figure 9 gives a general idea in which region of the original point cloud of all solutions the solutions we have selected turned out to be. Now, let us zoom in on the display area. In addition, we will slightly weaken the constraints on the criteria in order to exclude the rounding effect in the process of bringing the criteria to the 10-point scale: K 1 > 0.165 , K 2 > 1.134 and K 3 < 0.0088 . This extended sample contains 39 solutions, including 14 Pareto optimal solutions. The result is shown in Figure 10.
In Figure 10, the numbers of other solutions, in addition to the selected 5 solutions from Table 4, are marked. In these scaled figures, it is possible to compare different solutions in pairs. In particular, to make sure that the solution 2478, chosen by the formal method, is preferable. It is also interesting to compare the solutions 307 and 1734, which are located side by side on all three projections and have the same vector score.

8. Result and Discussion

After carrying out a numerical experiment, out of the generated 4000 solutions, only 2198 were found to be feasible in relation to the constraints of the model. Among such an abundance of solutions, it is impossible to choose the best one by examining the three-dimensional space of optimization criteria. Obtaining the set of Pareto optimal solutions allowed us to select 96 solutions. Further, the analysis of the criteria space was carried out in order to reduce the area of suitable solutions, and preferences were introduced regarding the importance and values of the criteria. Thus, we reduced the number of best solutions to 10 (Table 3), and subsequently chose one best solution. Further, the analysis of the obtained solutions is advisable to carry out using a visual analysis of solutions as shown in [11]. Here is a description of the selected solutions.
Table 6 shows the values of the optimized parameters for the selected solutions, as well as in Figure 11 and Figure 12 are a visual representation of the dynamic characteristics. A more detailed description of the visualization principles is presented in [11].
Figure 11 shows the characteristics of the movement of the system of the solution 307 with unequal mass loads on the first and second actuators ( c 1 = 0.688 , c 2 = 0.312 ):
(a)
indicators of the first actuator: curves of displacement and speed ( λ 1 , λ ˙ 1 ); in the upper part of this column I—pressure in its working cavity ( σ 1 );
(b)
indicators of the second actuator: curves of displacement and speed ( λ 2 , λ ˙ 2 ); in the upper part of this column II—pressure in its working cavity ( σ 2 );
(c)
channel opening curves ( β 0 , β 1 , β 2 ): changes in the mismatch criterion Δ λ in the movement of actuators, III—pressure in the intermediate cavity ( σ ).
The designations for these quantities were explained in the previous section. The curves in Figure 12 are arranged in the same order.
The values of all parameters for each solution can be viewed in Table 6. The scale for displacement λ is doubled relative to the pressure σ . The scale in speed λ ˙ is ten times the pressure. The β scale (flow area value) is increased five times relative to the pressure.
It follows from the graphs that under the conditions of the optimized solution 307 (Figure 11), despite the high load level of the actuators ( | χ L | = 1.378 ), and the imbalance in loading the right and left cargo ( c 1 = 0.688 , c 2 = 0.312 ), the given laws of motion actuators are implemented with good accuracy, and the pressures in all cavities after a short-term initial disturbance quickly stabilize and are practically invisible.
A short-term disturbance in the system is modeled by a variable χ L 1 , 2 , in Table 6 these are the variables χ L 1 and χ L 2 . The first actuator is supplied with an additional load χ L 1 = 0.001 , and practically does not affect the positioning process, the second actuator is supplied with χ L 2 = 0.036 , and we see a small jump in pressure σ 2 , which also insignificantly affects the positioning process. The operation of the system under the conditions of the solution 307 is distinguished by a very low sensitivity to variations in position and speed ( λ 1 , λ ˙ 1 ) parameters within the entire selected range.
The solution 2478 shows in Figure 12, in which unequal mass loads on the first and second actuators ( c 1 = 0.694 , c 2 = 0.306 ), short-term disturbances in the system ( χ L 1 = 0.048 and χ L 2 = 0.088 ) are set. Despite the more significant short-term disturbances, we see pressure surges in both actuators ( σ 1 and σ 2 graph), which practically does not affect the positioning process. This is primarily due to the correct choice of the remaining parameters of the optimized system. In [11], variants are presented when, for other parameters, but weaker perturbations, the system does not behave stably.
From a computational point of view, the process of generating 4000 alternative solutions in the MOVI software took the longest time—about 3 h on a personal computer. Each of these solutions had to be checked for feasibility, and, for this, the system of Equation (6) had to be solved by the Runge–Kutta method several times for different values of the parameter c1. On average, it took 15 such launches and 2.7 s to check one solution. All other calculations took almost no time and were invisible for experts working with the systems. The operation of decision rules in the DASS system in problems with up to 10 criteria takes less than a second [27]. Such problems of designing new mechanisms are one-off, individual, so it is permissible and even advisable to spend a lot of time on solutions search and careful analysis.

9. Conclusions

The procedure used in this work is based on two important factors: a rational mathematical model and a rational optimizing method. The effectiveness of the proposed procedure is shown by the example of solving a complex dynamic problem-choosing the best option for a technical project. The first factor made possible to simplify to the limit a real computational model by reducing the number of both parameters and criteria, which are considered as a purely physical value. The second factor allowed us to enter the area of best solutions with a significant reduction in options variation. In conclusion, we note the following main stages of work:
Developing a mathematical model of the investigated physical object;
Transition to dimensionless parameters;
On the basis of a dimensionless mathematical model of a physical object, multi-parameter and multicriteria optimization is carried out with the selection of the Pareto set;
Analysis of the criteria space in order to reduce the area of suitable solutions;
Preferences are introduced regarding the importance and values of criteria in the form of qualitative or imprecise quantitative (interval) estimates;
Visual analysis of the received solutions.
As an additional stage, the proposed procedure can also include an optimization stage in the transition from dimensionless to dimensional values. The technical design of a robotic system with two actuators operating in accordance mode, considered as an example, shows the effectiveness of the approach proposed.

Author Contributions

Conceptualization, S.M. and G.K.; Investigation, A.N. and N.N.; Methodology, S.M. and G.K.; Project administration, N.N.; Software, A.N.; Supervision, S.M.; Visualization, A.N. and N.N.; Writing—original draft, S.M., G.K., A.N. and N.N.; Writing—review and editing, G.K. and N.N. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The research was supported by Russian Foundation for Basic Research, project No. 18-29-10072 mk (Optimization of non-linear dynamic models of robotic drive systems taking into account forces of resistance of various nature, including frictional forces).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Pan, Q.; Zeng, Y.; Li, Y.; Jiang, X.; Huang, M. Experimental investigation of friction behaviors for double-acting hydraulic actuators with different reciprocating seals. Tribol. Int. 2021, 153, 1–14. [Google Scholar] [CrossRef]
  2. Tran, X.B.; Khaing, W.H.; Endo, H.; Yanada, H. Effect of friction model on simulation of hydraulic actuator. Proc. Inst. Mech. Eng. Part I J. Syst. Control. Eng. 2014, 228, 690–698. [Google Scholar] [CrossRef]
  3. Yang, G.; Yao, J.; Le, G.; Ma, D. Adaptive integral robust control of hydraulic systems with asymptotic tracking. Mechatronics 2016, 40, 78–86. [Google Scholar]
  4. Li, L.; Huanga, H.; Zhao, F.; Triebe, M.J.; Liu, Z. Analysis of a novel energy-efficient system with double-actuator for hydraulic press. Mechatronics 2017, 47, 77–87. [Google Scholar] [CrossRef]
  5. Misyurin, S.Y.; Kreinin, G.V. Dynamics and design of a power unit with a hydraulic piston actuator. Dokl. Phys. 2016, 61, 354–359. [Google Scholar] [CrossRef]
  6. Misyurin, S.Y.; Kreinin, G.V.; Nosova, N.Y. Similarity and analogousness in dynamical systems and their characteristic features. Russ. J. Nonlinear Dyn. 2019, 15, 213–220. [Google Scholar] [CrossRef] [Green Version]
  7. Cotsaftis, M.; Keskinen, E. Smooth High Precision Contact Posision Control of Rotating Cylinders with Hydraulic Actuators. In Proceedings of the 12th IFToMM World Congress, Besancon, France, 18–21 June 2007; pp. 738–743. [Google Scholar]
  8. Mamontov, M.A. Similarity; Min. Oboron: Moscow, Russia, 1971; p. 51. (In Russian) [Google Scholar]
  9. Kline, S.J. Similitude and Approximation Theory; McGrawHill Book Company, Inc.: New York, NY, USA, 1965; p. 229. [Google Scholar]
  10. Shea-Blymyer, C.; Roy, S.; Jantzen, B. A General Metric for the Similarity of Both Stochastic and Deterministic System Dynamics. Entropy 2021, 23, 1191. [Google Scholar] [CrossRef] [PubMed]
  11. Kreinin, G.V.; Misyurin, S.Y.; Nelyubin, A.P.; Nosova, N.Y. Visualization of the interconnection between dynamics of the system and its basic characteristics. Sci. Vis. 2020, 12, 9–20. [Google Scholar] [CrossRef]
  12. Sedov, L.I. Similarity and Dimensional Methods in Mechanics, 10th ed.; CRC: Boca Raton, FL, USA, 1993. (In Russian) [Google Scholar]
  13. Sonin, A.A. The Physical Basis of Dimensional Analysis, 2nd ed.; Department of Mechanical Engineering, MIT: Cambridge, UK, 2001; 57p. [Google Scholar]
  14. Misyurin, S.Y.; Kreinin, G.V.; Nelubin, A.P.; Nosova, N.Y. The synchronous movement of mechanisms taking into account forces of the different nature. J. Phys. Conf. Ser. 2020, 1439, 012016. [Google Scholar] [CrossRef]
  15. Jones, D.R.; Schonlau, M.; Welch, W.J. Efficient Global Optimization of Expensive Black-Box Functions. J. Glob. Optim. 1998, 13, 455–492. [Google Scholar] [CrossRef]
  16. Wang, L.; Shan, S.; Wang, G. Mode-Pursuing Sampling Method for Global Optimization on Expensive Black-Box Functions. Eng. Optim. 2004, 36, 419–438. [Google Scholar] [CrossRef]
  17. Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed.; Springer: Heidelberg/Berlin, Germany, 1996; 388p. [Google Scholar]
  18. Poli, R.; Kennedy, J.; Blackwell, T. Particle Swarm Optimization: An Overview. Swarm Intell. 2007, 1, 33–57. [Google Scholar] [CrossRef]
  19. Bertsimas, D.; Tsitsiklis, J. Simulated Annealing. Stat. Sci. 1993, 8, 10–15. [Google Scholar] [CrossRef]
  20. The Parameter Space Investigation Method Toolkit. Available online: http://www.psi-movi.com/ (accessed on 10 October 2021).
  21. Sobol, I.M.; Statnikov, R.B. Choice of Optimal Parameters in Multiple Criteria Problems; Drofa: Moscow, Russia, 2006; 176p. (In Russian) [Google Scholar]
  22. Podinovski, V.V.; Potapov, M.A. Weighted sum of criteria method in multi-criteria decision analysis: Pro et Contra. Bus. Inform. 2013, 3, 41–48. (In Russian) [Google Scholar]
  23. Nelyubin, A.P.; Galkin, T.P.; Galaev, A.A.; Popov, D.D.; Misyurin, S.Y.; Pilyugin, V.V. Usage of Visualization in the Solution of Multicriteria Choice Problems. Sci. Vis. 2017, 9, 59–70. [Google Scholar] [CrossRef]
  24. Miettinen, K.; Ruiz, F.; Wierzbicki, A.P. Introduction to Multiobjective Optimization: Interactive Approaches. In Multiobjective Optimization; Lecture Notes in Computer Science 5252; Branke, J., Deb, K., Miettinen, K., Słowiński, R., Eds.; Springer: Berlin/Heidelberg, Germany, 2008; pp. 27–57. [Google Scholar]
  25. Hayes-Roth, F.; Waterman, D.A.; Lenat, B. Building Expert Systems; Advanced Book Program; Addison-Wesley Publihsing Conpany, Inc.: Reading, MA, USA, 1983; 472p. [Google Scholar]
  26. Podinovski, V.V. Ideas and Methods of the Criteria Importance Theory in Multicriteria Decision Making Problems; Nauka: Moscow, Russia, 2019; 105p. (In Russian) [Google Scholar]
  27. Nelyubin, A.P.; Podinovski, V.V.; Potapov, M.A. Methods of criteria importance theory and their software implementation. In Springer Proceedings in Mathematics and Statistics 247, Computational Aspects and Applications in Large-Scale Networks, Nizhny Novgorod, Russia, June 2017; Kalyagin, V., Pardalos, P., Prokopyev, O., Utkina, I., Eds.; Springer: Cham, Switzerland, 2018; pp. 189–196. [Google Scholar]
  28. Nelyubin, A.P.; Podinovski, V.V. Multicriteria Choice Based on Criteria Importance Methods with Uncertain Preference Information. Comput. Math. Math. Phys. 2017, 57, 1475–1483. [Google Scholar] [CrossRef]
  29. Available online: http://mcodm.ru/soft/dass (accessed on 10 October 2021).
Figure 1. The model of the manipulator with two hydraulic actuators: p M —actuator supply pressure; p a —atmospheric pressure; P 1 , P 2 , P—pressure in the cavities 1, 2, 4, respectively; β , β 1 , β 2 —relative opening areas of the respective channels.
Figure 1. The model of the manipulator with two hydraulic actuators: p M —actuator supply pressure; p a —atmospheric pressure; P 1 , P 2 , P—pressure in the cavities 1, 2, 4, respectively; β , β 1 , β 2 —relative opening areas of the respective channels.
Mathematics 09 02854 g001
Figure 2. An example of the dependence of the criterion K 3 on the load parameter c 1 . The rest of the parameters are fixed.
Figure 2. An example of the dependence of the criterion K 3 on the load parameter c 1 . The rest of the parameters are fixed.
Mathematics 09 02854 g002
Figure 3. The set of solutions in the space of criteria: K 1 and K 2 . Blue dots denote admissible solutions, green circles-Pareto optimal solutions.
Figure 3. The set of solutions in the space of criteria: K 1 and K 2 . Blue dots denote admissible solutions, green circles-Pareto optimal solutions.
Mathematics 09 02854 g003
Figure 4. The set of solutions in the space of criteria: (a) K 1 and K 2 ; (b) K 1 and K 2 on a larger scale. Blue dots denote feasible solutions, crimson dots—infeasible ones due to the constraint K 1 > 0.1 , green circles—Pareto optimal solutions.
Figure 4. The set of solutions in the space of criteria: (a) K 1 and K 2 ; (b) K 1 and K 2 on a larger scale. Blue dots denote feasible solutions, crimson dots—infeasible ones due to the constraint K 1 > 0.1 , green circles—Pareto optimal solutions.
Mathematics 09 02854 g004
Figure 5. Non-dominated vector scores based on information about ordering criteria by importance.
Figure 5. Non-dominated vector scores based on information about ordering criteria by importance.
Mathematics 09 02854 g005
Figure 6. Estimation of value functions based on the centroid values of the decision maker’s preference parameters.
Figure 6. Estimation of value functions based on the centroid values of the decision maker’s preference parameters.
Mathematics 09 02854 g006
Figure 7. Non-dominated vector scores based on interval information about the importance of criteria.
Figure 7. Non-dominated vector scores based on interval information about the importance of criteria.
Mathematics 09 02854 g007
Figure 8. Non-dominated vector scores based on information on the scale of criteria.
Figure 8. Non-dominated vector scores based on information on the scale of criteria.
Mathematics 09 02854 g008
Figure 9. The set of solutions in the space of criteria: K 1 and K 2 . Selected solutions are numbered at the top.
Figure 9. The set of solutions in the space of criteria: K 1 and K 2 . Selected solutions are numbered at the top.
Mathematics 09 02854 g009
Figure 10. An extended set of solutions in the scaled space of criteria: K 1 and K 2 .
Figure 10. An extended set of solutions in the scaled space of criteria: K 1 and K 2 .
Mathematics 09 02854 g010
Figure 11. Estimated dynamic characteristics of the solution 307.
Figure 11. Estimated dynamic characteristics of the solution 307.
Mathematics 09 02854 g011
Figure 12. Estimated dynamic characteristics of the solution 2478.
Figure 12. Estimated dynamic characteristics of the solution 2478.
Mathematics 09 02854 g012
Table 1. The optimized parameters of the system and the ranges of their values.
Table 1. The optimized parameters of the system and the ranges of their values.
ParameterRange of ChangeComments
c 1 0.3 ÷ 0.7 weight load imbalance
χ L 2.0 ÷ 0.4 relative total operating load on actuators, simultaneously serving as a measure of their dimensions
λ V 0.2 ÷ 1.0 the measure of the volume of the intermediate chamber
β 0 0.3 ÷ 0.7 the share of the opening of the common channel in the line leading to the actuators that relates to the first actuator
α 1 0.25 ÷ 1.0 the ratio between the flow sections of the common supply channel and the channel leading to the first actuator
α 2 0.25 ÷ 1.0 the same for the channel leading to the second actuator
κ 1 0.05 ÷ 0.1 coefficient of friction of the first actuator
κ 2 0.05 ÷ 0.1 coefficient of friction of the second actuator
ϑ 1 25 ÷ 50 position feedback ratio
ϑ 2 0 ÷ 50 speed feedback ratio
ϑ D 25 ÷ 50 position feedback ratio
ϑ V 0 ÷ 5 speed feedback ratio
t A 0.02 ÷ 0.04 The time constant of the control system
t B 0.02 ÷ 0.04 The time constant of the valve 3 control system
λ 01 0.05 ÷ 1.0 the measure of the initial (harmful) volume of the first actuator
λ 02 0.05 ÷ 1.0 the measure of the initial (harmful) volume of the second actuator
χ L 1 0 ÷ 0.1 additional short-term intermittent drag force acting on the first actuator
χ L 2 0 ÷ 0.1 additional short-term intermittent drag force acting on the second actuator
τ S 10 ÷ 50 the mass m movement time
Table 2. The values of the initial criteria and the obtained vector scores y = ( y 1 , y 2 , y 3 ) for 45 options.
Table 2. The values of the initial criteria and the obtained vector scores y = ( y 1 , y 2 , y 3 ) for 45 options.
No. K 1 ,
10 3
K 2 K 3 ,
10 3
y 1 y 2 y 3 No. K 1 ,
10 3
K 2 K 3 ,
10 3
y 1 y 2 y 3 No. K 1 ,
10 3
K 2 K 3 ,
10 3
y 1 y 2 y 3
1591.301.5212.4310312671.761.323.7881026601.981.154.61069
2391.141.5811.1210413821.641.467.479728341.511.515.1699
2471.980.734.5102916151.691.445.279928411.761.4116.2891
2571.431.353.0581016911.371.514.949930051.281.557.73107
3071.881.386.598817341.901.326.398830931.971.347.51087
4421.711.466.889717601.461.505.059932541.990.684.71029
4641.991.105.8106818471.961.4013.8108232981.980.994.41059
6352.000.847.8103718491.791.103.5861034231.201.453.22910
6521.991.296.4107820101.841.3810.098534421.881.233.59710
8401.890.643.1911020571.101.568.6110634731.991.148.21066
8951.071.618.7110621121.751.4012.288436422.000.998.11057
9111.571.464.569922261.761.276.387837681.921.163.610610
9971.851.103.2961022361.991.176.5106838621.740.542.78110
10801.441.483.5591022761.231.5610.3310539001.931.3711.81084
12461.071.594.01101024781.941.233.71071039521.211.003.03510
Table 3. 10 vector scores and their the corresponding alternatives.
Table 3. 10 vector scores and their the corresponding alternatives.
No. K 1 K 2 K 3 y 1 y 2 y 3
3070.1881.380.0065988
4420.1711.460.0068897
10800.1441.480.00355910
12460.1071.590.004011010
12670.1761.320.00378810
16150.1691.440.0052799
17340.1901.320.0063988
24780.1941.230.003710710
30050.1281.550.00773107
30930.1971.340.00751087
Table 4. The 4 non-dominated vector scores and the corresponding 5 alternative solutions.
Table 4. The 4 non-dominated vector scores and the corresponding 5 alternative solutions.
No. y 1 y 2 y 3 Value Function Estimation
307; 17349880.846
126788100.802
2478107100.907
309310870.901
Table 5. The remaining non-dominated vector scores.
Table 5. The remaining non-dominated vector scores.
No. y 1 y 2 y 3 Value Function Estimation
307; 17349880.978
2478107100.983
309310870.980
Table 6. The optimized parameters of the system and the ranges of their values.
Table 6. The optimized parameters of the system and the ranges of their values.
ParameterRange3071267173424783093
c 1 0.3 ÷ 0.7 0.6880.6760.6900.6940.697
χ L 2.0 ÷ 0.4 −1.378−1.320−1.321−1.230−1.336
λ V 0.2 ÷ 1.0 0.8390.8470.5110.5670.726
β 0 0.3 ÷ 0.7 0.5070.6780.4330.6300.688
α 1 0.25 ÷ 1.0 0.7790.9640.8000.8010.676
α 2 0.25 ÷ 1.0 0.2950.6250.5980.7460.435
κ 1 0.05 ÷ 0.1 0.0590.0570.0520.0870.052
κ 2 0.05 ÷ 0.1 0.0630.0950.0600.0550.074
ϑ 1 25 ÷ 50 46.72944.71437.56138.15343.732
ϑ 2 0 ÷ 50 30.56617.4071.83133.53313.293
ϑ D 25 ÷ 50 72.31483.77787.36695.88038.715
ϑ V 0 ÷ 5 4.9900.8812.9862.8823.578
t A 0.02 ÷ 0.04 0.0340.0240.0200.0270.027
t B 0.02 ÷ 0.04 0.0310.0230.0280.0400.035
χ L 1 0 ÷ 0.1 0.0010.0560.0050.0480.096
χ L 2 0 ÷ 0.1 0.0360.0380.0780.0880.039
λ 01 0.05 ÷ 1.0 0.050.050.050.050.05
λ 02 0.05 ÷ 1.0 0.050.050.050.050.05
τ S 10 ÷ 50 44.45328.57426.73820.57630.596
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Misyurin, S.; Kreynin, G.; Nelyubin, A.; Nosova, N. Multicriteria Optimization of a Dynamic System by Methods of the Theories of Similarity and Criteria Importance. Mathematics 2021, 9, 2854. https://0-doi-org.brum.beds.ac.uk/10.3390/math9222854

AMA Style

Misyurin S, Kreynin G, Nelyubin A, Nosova N. Multicriteria Optimization of a Dynamic System by Methods of the Theories of Similarity and Criteria Importance. Mathematics. 2021; 9(22):2854. https://0-doi-org.brum.beds.ac.uk/10.3390/math9222854

Chicago/Turabian Style

Misyurin, Sergey, German Kreynin, Andrey Nelyubin, and Natalia Nosova. 2021. "Multicriteria Optimization of a Dynamic System by Methods of the Theories of Similarity and Criteria Importance" Mathematics 9, no. 22: 2854. https://0-doi-org.brum.beds.ac.uk/10.3390/math9222854

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop