<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vrgup</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Ростовского государственного университета путей сообщения</journal-title><trans-title-group xml:lang="en"><trans-title>Vestnik Rostovskogo Gosudarstvennogo Universiteta Putej Soobshcheniya</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">0201-727X</issn><publisher><publisher-name>Ростовский государственный университет путей сообщения</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.46973/0201-727X_2026_1_209</article-id><article-id custom-type="elpub" pub-id-type="custom">vrgup-218</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАШИНОСТРОЕНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MECHANICAL ENGINEERING</subject></subj-group></article-categories><title-group><article-title>Определение поля скоростей материаломелющей загрузки в бисерной мельнице с винтовым устройством</article-title><trans-title-group xml:lang="en"><trans-title>Determination of the velocity field of the material grinding loading in a bead mill with a screw device</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ханин</surname><given-names>С. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Khanin</surname><given-names>S. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Ханин Сергей Иванович, кафедра механического оборудования, доктор технических наук, профессор</p></bio><bio xml:lang="en"><p>Khanin Sergey Ivanovich, Chair of Mechanical Equipment, Doctor of Engineering Sciences, Professor</p></bio><email xlink:type="simple">sergiykhanin@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Зыбин</surname><given-names>Р. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Zybin</surname><given-names>R. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Зыбин Роман Владимирович, кафедра механического оборудования, аспирант</p></bio><bio xml:lang="en"><p>Zybin Roman Vladimirovich, Chair of Mechanical Equipment, Postgraduate Student</p></bio><email xlink:type="simple">zybin.roman97@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Воронов</surname><given-names>В. П.</given-names></name><name name-style="western" xml:lang="en"><surname>Voronov</surname><given-names>V. P.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Воронов Виталий Павлович , кафедра механического оборудования, кандидат физико-математических наук, профессор</p></bio><bio xml:lang="en"><p>Voronov Vitaly Pavlovich, Chair of Mechanical Equipment, Candidate of Physico-Mathematical Sciences, Professor</p></bio><email xlink:type="simple">v.p.voronov2018@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мордовская</surname><given-names>О. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Mordovskaya</surname><given-names>O. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Мордовская Ольга Сергеевна , кафедра прикладной информатики и информационных технологий, кандидат технических наук, доцент</p></bio><bio xml:lang="en"><p>Mordovskaya Olga Sergeevna, Chair of Applied Informatics and Information Technologies, Candidate of Engineering Sciences, Associate Professor</p></bio><email xlink:type="simple">unique.ox@gmail.com</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белгородский государственный технологический университет имени В. Г. Шухова (БГТУ им. В. Г. Шухова)</institution></aff><aff xml:lang="en"><institution>Belgorod State Technological University named after V. G. Shukhov (BSTU named after V. G. Shukhov)</institution></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Белгородский государственный национальный исследовательский университет» (НИУ «БелГУ»)</institution></aff><aff xml:lang="en"><institution>Belgorod State National Research University named after V. G. Shukhov (BSTU named after V. G. Shukhov)</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>30</day><month>03</month><year>2026</year></pub-date><volume>0</volume><issue>1</issue><fpage>209</fpage><lpage>218</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ханин С.И., Зыбин Р.В., Воронов В.П., Мордовская О.С., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Ханин С.И., Зыбин Р.В., Воронов В.П., Мордовская О.С.</copyright-holder><copyright-holder xml:lang="en">Khanin S.I., Zybin R.V., Voronov V.P., Mordovskaya O.S.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestnik.rgups.ru/jour/article/view/218">https://vestnik.rgups.ru/jour/article/view/218</self-uri><abstract><p>Применение бисерных мельниц распространено на промышленных предприятиях для тонкого и сверхтонкого помола различных многокомпонентных суспензий. Показаны целесообразность и возможность их конструктивного совершенствования. Приведено описание винтовых устройств, обеспечивающих повышение эффективности процесса диспергирования материала в корпусе мельницы. Обоснована необходимость в разработке математического описания, характеризующего работу бисерной мельницы разработанной конструкции, для установления ее рациональных параметров. Разработано математическое описание для определения продольной, радиальной и окружной компонент поля скоростей движения материаломелющей загрузки в корпусе горизонтальной бисерной мельницы с винтовыми устройствами. Проведены исследования влияния шага винта лопасти на величины компонент скорости ее движения, установлены закономерности, характеризующие возможность интенсификации процесса измельчения материала.</p></abstract><trans-abstract xml:lang="en"><p>The use of bead mills is widespread in industrial enterprises for fine and ultrafine grinding of various multicomponent suspensions. The expediency and possibility of their constructive improvement are shown. The description of screw devices providing an increase in the efficiency of the material dispersion process in the mill body is given. The necessity of developing a mathematical description characterizing the operation of the bead mill of the developed design is substantiated in order to establish its rational parameters. A mathematical description has been developed for determining the longitudinal, radial and circumferential components of the velocity field of the material-grinding load in the body of a horizontal bead mill with screw devices. Studies have been conducted on the effect of the pitch of the blade screw on the values of the components of its speed, and patterns have been established that characterize the possibility of intensifying the grinding process.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>бисерная мельница</kwd><kwd>математическое описание</kwd><kwd>поле скоростей</kwd><kwd>частота вращения</kwd><kwd>измельчение</kwd></kwd-group><kwd-group xml:lang="en"><kwd>bead mill</kwd><kwd>mathematical description</kwd><kwd>velocity field</kwd><kwd>rotation frequency</kwd><kwd>grinding</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Little, J. D. C. A Proof for the Queuing Formula L = λW / J. D. C. Little // Operations Research. – 1961. – Vol. 9 (3). – P. 383–387. – DOI 10.1287/opre.9.3.383.</mixed-citation><mixed-citation xml:lang="en">Little, J. D. C. A Proof for the Queuing Formula L = λW / J. D. C. Little // Operations Research. – 1961. – Vol. 9 (3). – P. 383–387. – DOI 10.1287/opre.9.3.383.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Fundamentals of Queueing Theory / D. Gross, J. F. Shortle, J. M. Thompson, C. M. Harris. – 4th ed. – Hoboken : John Wiley &amp; Sons, 2008. – 528 p. – ISBN 978-0-471-79127-0.</mixed-citation><mixed-citation xml:lang="en">Fundamentals of Queueing Theory / D. Gross, J. F. Shortle, J. M. Thompson, C. M. Harris. – 4th ed. – Hoboken : John Wiley &amp; Sons, 2008. – 528 p. – ISBN 978-0-471-79127-0.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ehrgott, M. Multicriteria Optimization / M. Ehrgott. – Berlin : Springer-Verlag, 2005. – 323 p. – ISBN 3-540-21398-8.</mixed-citation><mixed-citation xml:lang="en">Ehrgott, M. Multicriteria Optimization / M. Ehrgott. – Berlin : Springer-Verlag, 2005. – 323 p. – ISBN 3-540-21398-8.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">A fast and elitist multiobjective genetic algorithm: NSGA-II / K. Deb, A. Pratap, S. Agarwal, T. Meyarivan // IEEE Transactions on Evolutionary Computation. – 2002. – Vol. 6 (2). – P. 182–197. – DOI 10.1109/4235.996017.</mixed-citation><mixed-citation xml:lang="en">A fast and elitist multiobjective genetic algorithm: NSGA-II / K. Deb, A. Pratap, S. Agarwal, T. Meyarivan // IEEE Transactions on Evolutionary Computation. – 2002. – Vol. 6 (2). – P. 182–197. – DOI 10.1109/4235.996017.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Dijkstra, E. W. A note on two problems in connexion with graphs / E. W. Dijkstra // Numerische Mathematik. – 1959. – Vol. 1. – P. 269–271. – DOI 10.1007/BF01386390.</mixed-citation><mixed-citation xml:lang="en">Dijkstra, E. W. A note on two problems in connexion with graphs / E. W. Dijkstra // Numerische Mathematik. – 1959. – Vol. 1. – P. 269–271. – DOI 10.1007/BF01386390.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Introduction to Algorithms / T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein. – 3rd ed. – Cambridge, MA : MIT Press, 2009. – 1292 p. – ISBN 978-0-26253-305-8.</mixed-citation><mixed-citation xml:lang="en">Introduction to Algorithms / T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein. – 3rd ed. – Cambridge, MA : MIT Press, 2009. – 1292 p. – ISBN 978-0-26253-305-8.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Preparata, F. P. Computational Geometry: An Introduction / F. P. Preparata, M. I. Shamos. – New York : Springer-Verlag, 1985. – 390 p. – ISBN 0-387-96131-3.</mixed-citation><mixed-citation xml:lang="en">Preparata, F. P. Computational Geometry: An Introduction / F. P. Preparata, M. I. Shamos. – New York : Springer-Verlag, 1985. – 390 p. – ISBN 0-387-96131-3.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Algorithms and methods for solving scheduling problems and other extremum problems on large-scale graphs / S. V. Chernyshev, E. A. Cherepanov, E. V. Pankratiev, A. M. Chepovskii // Journal of Mathematical Sciences. – 2005. – Vol. 128 (6). – P. 3487–3495.</mixed-citation><mixed-citation xml:lang="en">Algorithms and methods for solving scheduling problems and other extremum problems on large-scale graphs / S. V. Chernyshev, E. A. Cherepanov, E. V. Pankratiev, A. M. Chepovskii // Journal of Mathematical Sciences. – 2005. – Vol. 128 (6). – P. 3487–3495.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Birge, J. R. Introduction to Stochastic Programming / J. R. Birge, F. Louveaux. – New York : Springer, 2011. – 485 p.</mixed-citation><mixed-citation xml:lang="en">Birge, J. R. Introduction to Stochastic Programming / J. R. Birge, F. Louveaux. – New York : Springer, 2011. – 485 p.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Shapiro, A. Lectures on Stochastic Programming : Modeling and Theory / A. Shapiro, D. Dentcheva, A. Ruszczyński. – Philadelphia : SIAM, 2009. – DOI 10.1137/1.9780898718751.</mixed-citation><mixed-citation xml:lang="en">Shapiro, A. Lectures on Stochastic Programming : Modeling and Theory / A. Shapiro, D. Dentcheva, A. Ruszczyński. – Philadelphia : SIAM, 2009. – DOI 10.1137/1.9780898718751.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Applications of Stochastic Programming / S. W. Wallace, W. T. Ziemba (eds.). – Philadelphia : SIAM, 2005. – 709 p. – ISBN 978-0-89871-555-2.</mixed-citation><mixed-citation xml:lang="en">Applications of Stochastic Programming / S. W. Wallace, W. T. Ziemba (eds.). – Philadelphia : SIAM, 2005. – 709 p. – ISBN 978-0-89871-555-2.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">King, A. J. Modeling with Stochastic Programming / A. J. King, S. W. Wallace. – New York : Springer, 2012. – DOI 10.1007/978-0-387-87817-1.</mixed-citation><mixed-citation xml:lang="en">King, A. J. Modeling with Stochastic Programming / A. J. King, S. W. Wallace. – New York : Springer, 2012. – DOI 10.1007/978-0-387-87817-1.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Ben-Tal, A. Robust Optimization / A. Ben-Tal, L. El Ghaoui, A. Nemirovski. – Princeton, NJ : Princeton University Press, 2009. – 576 p. – ISBN 978-0-691-14368-2.</mixed-citation><mixed-citation xml:lang="en">Ben-Tal, A. Robust Optimization / A. Ben-Tal, L. El Ghaoui, A. Nemirovski. – Princeton, NJ : Princeton University Press, 2009. – 576 p. – ISBN 978-0-691-14368-2.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Kall, P. Stochastic Programming / P. Kall, S. W. Wallace. – Chichester : John Wiley &amp; Sons, 1994. – 307 p. – ISBN 978-0-471-95108-7.</mixed-citation><mixed-citation xml:lang="en">Kall, P. Stochastic Programming / P. Kall, S. W. Wallace. – Chichester : John Wiley &amp; Sons, 1994. – 307 p. – ISBN 978-0-471-95108-7.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Martello, S. Knapsack Problems : Algorithms and Computer Implementations / S. Martello, P. Toth. – Chichester: John Wiley &amp; Sons ; 1990. – ISBN 978-0-471-92420-3.</mixed-citation><mixed-citation xml:lang="en">Martello, S. Knapsack Problems : Algorithms and Computer Implementations / S. Martello, P. Toth. – Chichester: John Wiley &amp; Sons ; 1990. – ISBN 978-0-471-92420-3.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
