SELECTION OF SOLUTIONS FOR DESIGNING OPEN SYSTEMS BASED ON ANALYSIS OF VARIANTS WITH RANDOM WEIGHTS
https://doi.org/10.32362/2500-316X-2018-6-4-78-88
Abstract
A new one-parameter approach to the selection of optimal solutions for the design of complex systems is proposed. The approach is based on the analysis of a tree of variants with random weights (here weight is a certain non-negative quantity: for example, cost, mass, energy consumption, etc.). At the root of the method suggested in the work lies the fact that the tree of variants forms a matroid, on which the optimal solution can be found using the "greedy" algorithm. The basis of the method proposed in the paper is the fact that in case of non-negative values of the mathematical expectation and variance of the elements of the variants tree they can be considered as components of vectors belonging to a semiring. It is shown that the appropriate definition of the operations of addition and multiplication makes it possible to define a function on the semiring. This function satisfies the norm axioms of vectors and coincides in structure with the expression for the upper bound of the confidence interval. After determining the weight of the tree elements through the introduced norm function the upper bound of the confidence interval of the variant tree with the minimum weight was found. The approach suggested in the work can be used at various stages of designing complex systems, including, among other things, the development of system profiles, and makes it possible to increase the validity of the decisions made.
About the Authors
A. A. Pastushkov
MIREA - Russian Technological University
Russian Federation
Russian Federation
V. K. Batovrin
MIREA - Russian Technological University
Russian Federation
Russian Federation
References
1. S1000D-B6865-01000-00 International specification for technical publications using a common source database. 2016. Iss. 4.
2. Access mode: http://public.s1000d.org/Downloads/Pages/S1000DDownloads.aspx 2. SO/IEC/IEEE 42010:2011 Systems and software engineering. Architecture description. Access mode: https://www.iso.org/standard/50508.html
3. Gubko M.V. Mathematical models of optimization of hierarchical structures. Moscow: Lenand Publ., 2008. 360 p. (in Russ.)
4. Gubanov D.A., Novikov D.A., Chkhartishvili A.G. Social networks: Models of information influence, governance and confrontation. Moscow: Fizmatlit, 2010. 228 p. (in Russ.)
5. Burkov V.N., Korgin N.A., Novikov D.A., Gubko M.V. Introduction to the theory of control in organizations. Boca Raton, USA: CRC Press, 2015. 346 p.
6. Novikov D.A. Complex models of system optimization of industrial and economic activity of the enterprise // Upravleniye bol'shimi sistemami (Management of Large Systems). 2017. Iss. 65. P. 118–152. (in Russ.)
7. Kuznetsov A.V. Distribution of limited resources in a system with a stable hierarchy (on the example of a prospective military communications system) // Upravleniye bol'shimi sistemami (Management of Large Systems). 2017. Iss. 66. P. 68–93. (in Russ.)
8. Gaykovich A.I. Fundamentals of the theory of designing complex technical systems. Saint-Petersburg: SRC "Morintekh", 2001. 432 p. (in Russ.)
9. Mezentsev Yu.A. Practical aspects of implementing an effective algorithm for solving optimal configuration problems // Reports of the Academy of Sciences of Higher School of the Russian Federation. 2013. № 1(20). P. 26–34. (in Russ.)
10. Ostrovsky G.M., Volin Yu.M. Technical systems under conditions of uncertainty. Moscow: BINOM. Laboratoriya znaniy Publ., 2008. 319 p. (in Russ.)
11. Rezchikov A.F., Kushnikov V.A., Ivaschenko V.A., Fominykh D.S., Bogomolov A.S., Filimonuk L.Yu. Models and algorithms for controlling the welding process by robotic technological complexes by the criterion of the quality of the products produced // Upravleniye bol'shimi sistemami (Management of Large Systems). 2018. Iss. 71. P. 98–122. (in Russ.)
12. Saati T., Kerns K. Analytical Planning. Organization of systems. Moscow: Radio i Svyaz’ Publ., 1991. 224 p. (in Russ.)
13. Nogin V.D. A logical substantiation of the Edgeworth-Pareto principle // Zhurnal vychislitel'noy matematiki i matematicheskoy fiziki (Journal of Computational Mathematics and Mathematical Physics). 2002. V. 42. № 7. P. 950–956. (in Russ.)
14. Nogin V.D. A simplified version of the method of analyzing hierarchies based on a non-linear convolution of the criteria // Zhurnal vychislitel'noy matematiki i matematicheskoy fiziki (Journal of Computational Mathematics and Mathematical Physics). 2004. V. 44. № 7. P. 1259–1268. (in Russ.)
15. Podinkovsky V.V., Podinkovskaya O.V. On the incorrectness of the method of analyzing hierarchies // Problemy upravleniya (Problems of Management). 2011. № 1. P. 8–13. (in Russ.)
16. Golenko-Ginzburg, D.I. Stochastic network models of planning and development management. Voronezh: Nauchnaya kniga Publ., 2010. 284 p. (in Russ.)
17. Petrushin V.N., Ulyanov M.V. Information sensitivity of computer algorithms. Moscow: Fizmatlit Publ., 2010. 224 p. (in Russ.)
18. Ulyanov M.V., Petrushin V.N., Kriventsov A.S. Confidence-based laboriousness – a new assessment of the quality of algorithms // Inform. tekhnologii i vychislit. sistemy (Information Technology and Computing Systems). 2009. № 2. P. 23–37. (in Russ.)
19. Oxley J.G. Matroid Theory. Oxford University Press, 1993. 532 p.
20. Pugachev V.S. Theory of Probability and Mathematical Statistics. Moscow: Nauka Publ., 1979. 496 p. (in Russ.)
21. Shitov Ya.N. On the coincidence of the factorization rank and the Gondran-Mina rank of matrices over a semiring // Fundamental'naya i prikladnaya matematika (Fundamental and Applied Mathematics). 2011/2012. V. 17. № 6. P. 223–232. (in Russ.)
22. Shmatkov V.D. Isomorphisms and automorphisms of matrix algebras over semirings // Fundamental'naya i prikladnaya matematika (Fundamental and Applied Mathematics). 2014. V. 19. № 6. P. 251–260. (in Russ.)
23. Guterman A.E., Kreines E.M. Monotone linear maps of matrices over semirings // Fundamental'naya i prikladnaya matematika (Fundamental and Applied Mathematics). 2016. V. 21. № 1. P. 105–122. (in Russ.)
24. Shafarevich I.R. Basic concepts of algebra. Izhevsk: Izhevsk Republican Printing House, 1999. 348 p. (in Russ.)
25. Lipsky V. Combinatorics for the programmer. Moscow: Mir Publ., 1988. 200 p. (in Russ.)
Review
For citations:
Pastushkov A.A., Batovrin V.K. SELECTION OF SOLUTIONS FOR DESIGNING OPEN SYSTEMS BASED ON ANALYSIS OF VARIANTS WITH RANDOM WEIGHTS. Russian Technological Journal. 2018;6(4):78-88. (In Russ.) https://doi.org/10.32362/2500-316X-2018-6-4-78-88
Views:
437
Email this article 