maisМоделирование и анализ информационных системModeling and Analysis of Information Systems1818-10152313-5417Yaroslavl State University10.18255/1818-1015-2023-3-258-263mais-1803Research ArticleDiscrete Mathematics in Relation to Computer ScienceПрименение алгоритма поиска внешней медианы графа в задачах определения надежности технических системApplication of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systemshttps://orcid.org/0000-0003-0785-8272ПлаксаЮрий АндреевичPlaksaYuri A.plaksa-06@mail.ruhttps://orcid.org/0000-0001-7261-0439КурочкинаСветлана АлексеевнаKurochkinaSvetlana A.svetlana_k_621@mail.ruhttps://orcid.org/0000-0002-2805-5228ПрусоваНаталия АлександровнаPrusovaNataliya A.natali_pet@mail.ruЯрославское высшее военное училище противовоздушной обороныРоссияYaroslavl Higher Military School of Air DefenseRussian Federation202317092023303258263Copyright © Плакса Ю.А., Курочкина С.А., Прусова Н.А., 20232023Плакса Ю.А., Курочкина С.А., Прусова Н.А.Plaksa Y.A., Kurochkina S.A., Prusova N.A.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://www.mais-journal.ru/jour/article/view/1803

Рассмотрена задача о размещении центра обслуживания технических систем при известных значениях потоков отказов. Даная задача решалась с помощью минисуммного алгоритма теории графов. Получена зависимость коэффициента готовности системы от среднего времени наработки между отказами и среднего времени восстановления элементов системы. Показано, что оптимальным местом расположения пункта технического обслуживания является медиана графа, расположенная в одной из его вершин.

The problem of locating a service center for technical systems with known values of failure flows is considered. This problem was solved using the minisum algorithm of graph theory. The dependence of the system availability factor on the average time between failures and the average recovery time of the system elements is obtained. It is shown that the optimal location of the maintenance point is the median of the graph located at one of its vertices.

неориентированный взвешенный графминисуммный алгоритмвершина графамедиана графапередаточное числоцентр технического обслуживанияпоказатель надежности.undirected weighted graphminisum algorithmgraph vertexgraph mediangear ratiomaintenance centerreliability index.ReferencesA. V. Oleinik, E. A. Lukashev, S. P. Poserenin, and M. E. Stavrovskiy, “Graph method in reliability theory and practice of technical service,” Izvestiya MGTU MAMI, vol. 4, no. 2, pp. 236–247, 2010.A. V. Oleinik, E. A. Lukashev, S. P. Poserenin, and M. E. Stavrovskiy, “Graph method in reliability theory and practice of technical service,” Izvestiya MGTU MAMI, vol. 4, no. 2, pp. 236–247, 2010.H. J. Miser, Handbook of Operations Research: foundations and fundamentals. Van Nostrand Reinhold, 1978.H. J. Miser, Handbook of Operations Research: foundations and fundamentals. Van Nostrand Reinhold, 1978.M. Aoki, Introduction to optimization techniques. Fundamentals and applications of nonlinear programming. Macmillan, 1971.M. Aoki, Introduction to optimization techniques. Fundamentals and applications of nonlinear programming. Macmillan, 1971.G. G. Zabudsky and N. S. Veremchuk, “Reshenie zadachi Vebera na ploskosti s minimaksnym kriteriem i zapreshchennymi zonami ,” Izvestiya Irkutskogo gosudarstvennogo universiteta. Seriya: Matematika, vol. 9, pp. 10–25, 2014.G. G. Zabudsky and N. S. Veremchuk, “Reshenie zadachi Vebera na ploskosti s minimaksnym kriteriem i zapreshchennymi zonami ,” Izvestiya Irkutskogo gosudarstvennogo universiteta. Seriya: Matematika, vol. 9, pp. 10–25, 2014.V. L. Beresnev and A. A. Mel’nikov, “Approximate algorithms for the competitive facility location problem,” Journal of Applied and Industrial Mathematics, vol. 5, pp. 180–190, 2011.V. L. Beresnev and A. A. Mel’nikov, “Approximate algorithms for the competitive facility location problem,” Journal of Applied and Industrial Mathematics, vol. 5, pp. 180–190, 2011.V. M. Demidenko, “Generalizing strong feasibility conditions for the quadratic assignment problem with anti-Monge and Toeplitz matrices,” in Doklady Natsionalnoi Akademii Nauk Belarusi, 2003, vol. 47, no. 2, pp. 15–18.V. M. Demidenko, “Generalizing strong feasibility conditions for the quadratic assignment problem with anti-Monge and Toeplitz matrices,” in Doklady Natsionalnoi Akademii Nauk Belarusi, 2003, vol. 47, no. 2, pp. 15–18.A. A. Kolokolov, T. V. Levanova, and M. A. Loresh, “Algoritmy murav'inoj kolonii dlja zadach optimal'nogo razmeshhenija predprijatij,” Omskij nauchnyj vestnik, vol. 38, no. 4, pp. 62–67, 2006.A. A. Kolokolov, T. V. Levanova, and M. A. Loresh, “Algoritmy murav'inoj kolonii dlja zadach optimal'nogo razmeshhenija predprijatij,” Omskij nauchnyj vestnik, vol. 38, no. 4, pp. 62–67, 2006.I. L. Vasiliev, K. B. Klimentova, and Y. A. Kochetov, “Novye nizhnie otsenki dlya zadachi razmeshcheniya s predpochteniyami klientov,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, vol. 49, no. 6, pp. 1055–1066, 2009.I. L. Vasiliev, K. B. Klimentova, and Y. A. Kochetov, “Novye nizhnie otsenki dlya zadachi razmeshcheniya s predpochteniyami klientov,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, vol. 49, no. 6, pp. 1055–1066, 2009.E. V. Alekseeva and Y. A. Kochetov, “Geneticheskii lokal'nyi poisk dlya zadachi o p-mediane s predpochteniyami klientov,” Diskretnyi analiz i issledovanie operatsii, vol. 14, no. 1, pp. 3–31, 2007.E. V. Alekseeva and Y. A. Kochetov, “Geneticheskii lokal'nyi poisk dlya zadachi o p-mediane s predpochteniyami klientov,” Diskretnyi analiz i issledovanie operatsii, vol. 14, no. 1, pp. 3–31, 2007.Y. A. Kochetov, M. G. Pashchenko, and A. V. Plyasunov, “O slozhnosti lokal'nogo poiska v zadache o p-mediane,” Diskretnyi analiz i issledovanie operatsii, vol. 12, no. 2, pp. 44–71, 2005.Y. A. Kochetov, M. G. Pashchenko, and A. V. Plyasunov, “O slozhnosti lokal'nogo poiska v zadache o p-mediane,” Diskretnyi analiz i issledovanie operatsii, vol. 12, no. 2, pp. 44–71, 2005.E. K. Gimadi, “O veroyatnostnom analize priblizhennogo algoritma resheniya zadachi o p-mediane,” Diskretnyi analiz i issledovanie operatsii, vol. 17, no. 3, pp. 19–31, 2010.E. K. Gimadi, “O veroyatnostnom analize priblizhennogo algoritma resheniya zadachi o p-mediane,” Diskretnyi analiz i issledovanie operatsii, vol. 17, no. 3, pp. 19–31, 2010.I. N. Rosenberg, “Odnokriterial'naya minisummnaya zadacha razmeshcheniya tsentra obsluzhivaniya s lingvisticheskimi peremennymi,” Izvestiya Yuzhnogo federal'nogo universiteta. Tekhnicheskie nauki, vol. 31, no. 2, pp. 56–63, 2003.I. N. Rosenberg, “Odnokriterial'naya minisummnaya zadacha razmeshcheniya tsentra obsluzhivaniya s lingvisticheskimi peremennymi,” Izvestiya Yuzhnogo federal'nogo universiteta. Tekhnicheskie nauki, vol. 31, no. 2, pp. 56–63, 2003.“ GOST 27.002-2015: Dependability in technics. Terms and definitions.” 2015.“ GOST 27.002-2015: Dependability in technics. Terms and definitions.” 2015.N. Christofides, Graph theory: An algorithmic approach. Academic Press, Inc., 1975.N. Christofides, Graph theory: An algorithmic approach. Academic Press, Inc., 1975.A. M. Polovko and S. V. Gurov, Osnovy teorii nadezhnosti. BHV, 2006.A. M. Polovko and S. V. Gurov, Osnovy teorii nadezhnosti. BHV, 2006.

The authors declare that there are no conflicts of interest present.