<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.55648/1998-6920-2022-16-1-97-107</article-id><article-id custom-type="elpub" pub-id-type="custom">sibsutis-124</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></article-categories><title-group><article-title>Методология выбора трасс для прокладки сетей и коммуникаций</article-title><trans-title-group xml:lang="en"><trans-title>The route choosing methodology for networks and communications laying</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>Toktoshov</surname><given-names>G. Y.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Токтошов Гулжигит Ысакович, к.т.н., доцент кафедры ММиЦРБС СибГУТИ; научный сотрудник лаборатории СМиО ИВМиМГ СО РАН</p><p>630102, Новосибирск, ул. Кирова, 86</p><p>630090, Новосибирск, просп. Академика Лаврентьева, 6</p></bio><bio xml:lang="en"><p>Gulhzigit Y. Toktoshov, Candidate of technical sciences, Docent, Siberian State University of Telecommunications and Information Sciences (SibSUTIS); Researcher, The Institute of Computational Mathematics and Mathematical Geophysics SB RAS</p><p>Novosibirsk</p></bio><email xlink:type="simple">tgi_tok@rambler.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>СибГУТИ; ИВМиМГ СО РАН</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Siberian State University of Telecommunications and Information Sciences (SibSUTIS); The Institute of Computational Mathematics and Mathematical Geophysics SB RAS</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>13</day><month>05</month><year>2022</year></pub-date><volume>0</volume><issue>1</issue><fpage>97</fpage><lpage>107</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Токтошов Г.Ы., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Токтошов Г.Ы.</copyright-holder><copyright-holder xml:lang="en">Toktoshov G.Y.</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.sibsutis.ru/jour/article/view/124">https://vestnik.sibsutis.ru/jour/article/view/124</self-uri><abstract><p>Предлагается новая методика выбора трасс для прокладки инженерных коммуникаций, учитывающая насыщенность городской застройки различными инфраструктурными объектами инженерного обеспечения, вид и назначение проектируемой коммуникации, углы поворота коммуникации вокруг заданной оси при обходе препятствий и другие ограничения. В отличие от традиционного представления, трасса для прокладки коммуникаций рассматривается как объект в трехмерном пространстве, имеющий ограничение как по плану, так и по профилю – по высоте расположения сетевых объектов. Кроме того, область, на которой предполагается разместить сеть, рассматривается как трехмерное пространство и моделируется в виде трехмерной расчетной сети. Задача оптимизации коммуникаций поставлена в виде построения минимальной гиперсети при ограничениях и требованиях, накладываемых на проектируемую коммуникацию. Предложен модифицированный метод трассировки лучей, позволяющий выбрать трассу в зависимости от угловых и линейных координат, предопределяющих положение проектируемой коммуникации в пространстве.</p></abstract><trans-abstract xml:lang="en"><p>In this paper a new route selecting method for laying engineering communications taking into account the urban development saturation with various infrastructural objects, designed communications type and purpose, communications rotation angles around a given axis when avoiding obstacles, and other restrictions is proposed. The communications laying routes unlike the traditional representation are considered as three-dimensional object in space which has a restriction according both plan and profile. In addition, the communications placement region is considered as a three-dimensional space and is modeled as a three-dimensional computational network. The communications optimization task in the form of minimal hypernet structure with restrictions and requirements imposed on the designed communications is proposed. A modified ray tracing method enabling to choose a path depending on the angular and linear coordinates predetermining the communications position in space is proposed.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>трасса</kwd><kwd>инженерная коммуникация</kwd><kwd>инфраструктура</kwd><kwd>граф</kwd><kwd>гиперсеть</kwd><kwd>трехмерное преобразование</kwd></kwd-group><kwd-group xml:lang="en"><kwd>route</kwd><kwd>communications</kwd><kwd>infrastructure</kwd><kwd>graph</kwd><kwd>hypernet</kwd><kwd>3D transformation</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследования выполнены в рамках государственного задания ИВМиМГ СО РАН (0251-2021-0005)</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Казаков А. Л., Лемперт А. А. Об одном подходе к решению задач оптимизации, возникающих в транспортной логистике // Автоматика и телемеханика. 2011. № 7. С. 50–57.</mixed-citation><mixed-citation xml:lang="en">Kazakov A. L., Lempert A. A. Ob odnom podhode k resheniju zadach optimizacii, vozni-kajushhih v transportnoj logistike [On one approach to solving optimization problems arising in transport logistics]. Avtomatika i telemehanika. 2011, no. 7, pp. 50-57.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Djebedjian B., El-NaggarM., and Shahin I. Optimal design of gas distribution network: a case study // Mansoura Engineering Journal (MEJ). 2011. V. 36, № 3. P. 35–51.</mixed-citation><mixed-citation xml:lang="en">Djebedjian B., El-NaggarM., and Shahin I. Optimal design of gas distribution network: a case study. Mansoura Engineering Journal (MEJ). 2011, vol. 36, no. 3, pp. 35-51.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Heidarifar M., and Ghasemi H. A network topology optimization model based on substation and node-breaker modeling // IEEE Trans. on Power Systems. 2016. V. 31, № 1. P. 247–255.</mixed-citation><mixed-citation xml:lang="en">Heidarifar M., and Ghasemi H. A network topology optimization model based on substation and node-breaker modeling. IEEE Trans. on Power Systems. 2016, vol. 31, no. 1, pp. 247-255.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Li F., Liu Q., Guo X., and Xiao J. A survey of optimization method for oil-gas pipeline network layout // Proc. International Conference on Mechatronics, Electronic, Industrial and Control Engineering (MEIC), April 1–3, 2015, Shenyang, China. P. 257–260.</mixed-citation><mixed-citation xml:lang="en">Li F., Liu Q., Guo X., and Xiao J. A survey of optimization method for oil-gas pipeline network layout. Proc. International Conference on Mechatronics, Electronic, Industrial and Control Engineering (MEIC), April 1-3, 2015, Shenyang, China, pp. 257-260.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Edgar T. F., Himmelblau D. M., and Bickel T. C. Optimal design of gas transmission networks // SPE J. 1978. № 18. P. 96–104.</mixed-citation><mixed-citation xml:lang="en">Edgar T. F., Himmelblau D. M., and Bickel T. C. Optimal design of gas transmission networks. SPE J. 1978, no. 18, pp. 96-104.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Dong G., Qing T., Du R., Wang C., Li R. et al. Complex network approach for the structural optimization of global crude oil trade system // Journal of Cleaner Production. 2020. V. 251. URL: https://doi.org/10.1016/j.jclepro.2019.119366 (дата обращения: 19.01.2022).</mixed-citation><mixed-citation xml:lang="en">Dong G., Qing T., Du R., Wang C., Li R. et al. Complex network approach for the structural optimization of global crude oil trade system. Journal of Cleaner Production. 2020, vol. 251. URL: https://doi.org/10.1016/j.jclepro.2019.119366 (access date: 19.01.2022).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Liong S.-Y., and Atiquzzaman M. Optimal design of water distribution network using shuffled complex evolution // Journal of The Institution of Engineers (Singapore). 2004. V. 44, Is. 1. P. 93–107.</mixed-citation><mixed-citation xml:lang="en">Liong S.-Y., and Atiquzzaman M. Optimal design of water distribution network using shuffled complex evolution. Journal of The Institution of Engineers (Singapore). 2004, vol. 44, is. 1, pp. 93-107.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Tricarico С., Gargano R., De Marinis G., Morley M. S., Kapelan Z., Savic D. A. The influence of network topology on water distribution system performance // Proc. 10th International Conference on Hydroinformatics (HIC), 2012, Hamburg, Germany, URL: https://www.researchgate.net/publication/230931471_The_Influence_of_Network_Topology_on_Water_Distribution_System_Performance (дата обращения: 28.01.2022).</mixed-citation><mixed-citation xml:lang="en">Tricarico S., Gargano R., De Marinis G., Morley M. S., Kapelan Z., Savic D. A. The influence of network topology on water distribution system performance. Proc. 10th International Conference on Hydroinformatics (HIC), 2012, Hamburg, Germany, URL: https://www.researchgate.net/publication/230931471_The_Influence_of_Network_Topology_on_Water_Distribution_System_Performance (access date: 28.01.2022).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Lee H. M., Yoo D. G., Sadollah A., and Kim J. H. Optimal cost design of water distribution networks using a decomposition approach // Engineering Optimization. 2016. V. 48, № 12. P. 2141–2156. URL: https://doi.org/10.1080/0305215X.2016.1157689 (дата обращения: 03.02.2022).</mixed-citation><mixed-citation xml:lang="en">Lee H. M., Yoo D. G., Sadollah A., and Kim J. H. Optimal cost design of water distribution networks using a decomposition approach. Engineering Optimization. 2016, vol. 48, no. 12, pp. 2141-2156. URL: https://doi.org/10.1080/0305215X.2016.1157689 (access date: 03.02.2022).</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Лебедянцев В. В., Деревяшкин В. М. Тензорная модель сети связи // Вестник СибГУТИ. 2014. № 2. С. 50–56.</mixed-citation><mixed-citation xml:lang="en">Lebedjancev V. V., Derevjashkin V. M. Tenzornaja model' seti svjazi [Tensor model of a communication network]. Vestnik SibGUTI. 2014, no. 2, pp. 50-56.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Одрин В. М. Метод морфологического анализа технических систем. М.: ВНИИПИ, 1989. 312 с.</mixed-citation><mixed-citation xml:lang="en">Odrin V. M. Metod morfologicheskogo analiza tehnicheskih system [Method of morphological analysis of technical systems]. Moscow: VNIIPI, 1989, 312 p.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Стенников В. А., Чемезов А. А. Применение алгоритма перебора деревьев и метода имитации отжига для схемно-структурной оптимизации тепловых сетей // Программные продукты и системы. 2018. № 2 (31). С. 387–395.</mixed-citation><mixed-citation xml:lang="en">Stennikov V. A., Chemezov A. A. Primenenie algoritma perebora derev'ev i metoda imi-tacii otzhiga dlja shemno-strukturnoj optimizacii teplovyh setej [Application of tree enumeration algorithm and annealing simulation method for scheme-structural optimization of heat networks]. Programmnye produkty i sistemy. 2018, no. 2 (31), pp. 387-395.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Наумов И. В., Ямщикова И. В. Математическое обоснование выбора оптимизационной модели трассировки электрической сети // Евразийский Союз Ученых (ЕСУ). 2015. № 7 (16). С. 123–127.</mixed-citation><mixed-citation xml:lang="en">Naumov I. V., Jamshhikova I. V. Matematicheskoe obosnovanie vybora optimizacionnoj modeli trassirovki jelektricheskoj seti [Mathematical substantiation of the choice of an optimization model for tracing an electrical network]. Evrazijskij Sojuz Uchenyh (ESU). 2015, no. 7 (16), pp. 123-127.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Степанов В. П. Оптимизация маршрутов на дорожной сети // Наука и образование. 2012. № 5. С.1–12.</mixed-citation><mixed-citation xml:lang="en">Stepanov V. P. Optimizacija marshrutov na dorozhnoj seti [Route optimization on the road network]. Nauka i obrazovanie. 2012, no. 5, pp.1-12.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Акимов С. В. Модель морфологического множества уровня идентификации // Труды учебных заведений связи. 2005. № 172. С. 120–135.</mixed-citation><mixed-citation xml:lang="en">Akimov S. V. Model' morfologicheskogo mnozhestva urovnja identifikacii [Model of the morphological set of the level of identification]. Trudy uchebnyh zavedenij svjazi. 2005, no. 172, pp. 120-135.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Golumbic M. C., Kaplan H., Shamir R. Graph sandwich problems // Journal of Algorithms. 1995. № 19 (3). P. 449–473. DOI:10.1006/jagm.1995.1047.</mixed-citation><mixed-citation xml:lang="en">Golumbic M. C., Kaplan H., Shamir R. Graph sandwich problems. Journal of Algorithms. 1995, no. 19 (3), pp. 449-473. DOI:10.1006/jagm.1995.1047.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Poulovassilis A., Levene M. A nested-graph model for the representation and manipulation of complex objects // J. ACM Trans. Inf. Syst. 1994. V. 12. P. 35–68.</mixed-citation><mixed-citation xml:lang="en">Poulovassilis A., Levene M. A nested-graph model for the representation and manipulation of complex objects. J. ACM Trans. Inf. Syst. 1994, vol. 12, pp. 35-68.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Orlowski S., Koster A. M. C. A., Raack C., Wessäly R. Two-layer network design by branch-andcut featuring MIP-based heuristics // Proc. 3rd International Network Optimization Conference (INOC), Spa, Belgium, 2007. P. 114–119.</mixed-citation><mixed-citation xml:lang="en">Orlowski S., Koster A. M. C. A., Raack C., Wessäly R. Two-layer network design by branch-and-cut featuring MIP-based heuristics. Proc. 3rd International Network Optimization Conference (INOC), Spa, Belgium, 2007, pp. 114-119.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Capone A., Carello G., Matera R. Multi-layer network design with multicast traffic and statistical multiplexing // Proc. IEEE Global Telecommunications Conference (IEEE GLOBECOM), Washington, USA, 2007. Р. 2565–2570.</mixed-citation><mixed-citation xml:lang="en">Capone A., Carello G., Matera R. Multi-layer network design with multicast traffic and statistical multiplexing. Proc. IEEE Global Telecommunications Conference (IEEE GLOBECOM), Washington, USA, 2007, pp. 2565-2570.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Kurant M., Thiran P. Layered complex networks // J. Phys. Rev. Lett. 2006. V. 96. P. 1–4.</mixed-citation><mixed-citation xml:lang="en">Kurant M., Thiran P. Layered complex networks. J. Phys. Rev. Lett. 2006, vol. 96, pp. 1-4.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Попков В. К. О моделировании городских транспортных систем гиперсетями // Автоматика и телемеханика. 2011. В. 72, № 6. С. 179–189.</mixed-citation><mixed-citation xml:lang="en">Popkov V. K. O modelirovanii gorodskih transportnyh sistem gipersetjami [On the modeling of urban transport systems by hypernets]. Avtomatika i telemehanika. 2011, vol. 72, no. 6, pp. 179-189.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Токтошов Г. Ы., Юргенсон А. Н., Мигов Д. А. О сложности задач оптимизации сетей инженерных коммуникаций // T-Comm: Телекоммуникации и транспорт. 2020. Т. 14, № 9. С. 17–23.</mixed-citation><mixed-citation xml:lang="en">Toktoshov G. Y., Jurgenson A. N., Migov D. A. O slozhnosti zadach optimizacii setej inzhenernyh kommunikacij [On the complexity of engineering network optimization problems] T-Comm: Telekommunikacii i transport. 2020, vol. 14, no. 9, pp. 17-23.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Chen B., and Kaufman A. 3D volume rotation using shear transformations // Graphical Models. 2000. V. 62, Is. 4. P. 308–322.</mixed-citation><mixed-citation xml:lang="en">Chen B., and Kaufman A. 3D volume rotation using shear transformations. Graphical Models. 2000, vol. 62, is. 4, pp. 308-322.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Schmitt A., Muller H., and Leister W. Ray Tracing Algorithms – Theory and Practice // Theoretical Foundations of Computer Graphics and CAD. Jan 1988. P. 997–1030.</mixed-citation><mixed-citation xml:lang="en">Schmitt A., Muller H., and Leister W. Ray Tracing Algorithms - Theory and Practice. Theoretical Foundations of Computer Graphics and CAD. Jan 1988, pp. 997-1030.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Трассировка лучей [Электронный ресурс]. URL: https://studme.org/156199/informatika/trassirovka_luchey (дата обращения: 20.03.2022).</mixed-citation><mixed-citation xml:lang="en">Trassirovka luchej [Ray tracing] [Electronic resource]. URL: https://studme.org/156199/informatika/trassirovka_luchey (access date: 20.03.2022).</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>
