<?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">firesmi</journal-id><journal-title-group><journal-title xml:lang="ru">Пожаровзрывобезопасность/Fire and Explosion Safety</journal-title><trans-title-group xml:lang="en"><trans-title>Pozharovzryvobezopasnost/Fire and Explosion Safety</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">0869-7493</issn><issn pub-type="epub">2587-6201</issn><publisher><publisher-name>ФГБОУ ВО «Национальный исследовательский Московский государственный строительный университет»</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22227/0869-7493.2023.32.02.71-78</article-id><article-id custom-type="elpub" pub-id-type="custom">firesmi-1224</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>MEANS AND WAYS OF FIRE EXTINGUISHING</subject></subj-group></article-categories><title-group><article-title>Применение метода Кларка – Райта в задачах тушения лесных пожаров силами авиационной охраны</article-title><trans-title-group xml:lang="en"><trans-title>Application of Clarke and Wright algorithm in the tasks of forest fire suppression by aviation forest air protection</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-9158-8801</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ермаков</surname><given-names>С. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Ermakov</surname><given-names>S. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>старший преподаватель кафедры комплексной безопасности в строительстве</p></bio><bio xml:lang="en"><p>Senior Lecturer of Integrated Safety in Civil Engineering</p></bio><email xlink:type="simple">ErmakovSA@mgsu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8293-678X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Дмитриев</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Dmitriev</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>студент кафедры комплексной безопасности в строительстве</p></bio><bio xml:lang="en"><p>Student of Integrated Safety in Civil Engineering</p></bio><email xlink:type="simple">89020821214@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1465-3005</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Постаногова</surname><given-names>П. Ф.</given-names></name><name name-style="western" xml:lang="en"><surname>Postanogova</surname><given-names>P. F.</given-names></name></name-alternatives><bio xml:lang="ru"><p>студент кафедры комп­лексной безопасности в строительстве</p></bio><bio xml:lang="en"><p>Student of Integrated Safety in Civil Engineering</p></bio><email xlink:type="simple">sud00@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-3916-8452</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Толстиков</surname><given-names>Д. О.</given-names></name><name name-style="western" xml:lang="en"><surname>Tolstikov</surname><given-names>D. O.</given-names></name></name-alternatives><bio xml:lang="ru"><p>студент</p></bio><bio xml:lang="en"><p>Student</p></bio><email xlink:type="simple">dimastarcraft2014@gmail.com</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Национальный исследовательский Московский государственный строительный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>National Research Moscow State University of Civil Engineering</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Московский авиационный институт (национальный исследовательский университет)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Moscow Aviation Institute (National Research University)</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>28</day><month>04</month><year>2023</year></pub-date><volume>32</volume><issue>2</issue><fpage>71</fpage><lpage>78</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ермаков С.А., Дмитриев А.А., Постаногова П.Ф., Толстиков Д.О., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Ермаков С.А., Дмитриев А.А., Постаногова П.Ф., Толстиков Д.О.</copyright-holder><copyright-holder xml:lang="en">Ermakov S.A., Dmitriev A.A., Postanogova P.F., Tolstikov D.O.</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://www.fire-smi.ru/jour/article/view/1224">https://www.fire-smi.ru/jour/article/view/1224</self-uri><abstract><sec><title>Введение</title><p>Введение. Целью данного исследования является определение минимальных затрат на путь до очагов низового лесного пожара и на его локализацию. Для достижения поставленной цели выполняются задачи: по анализу выбранного метода для расчета минимальных затрат на процесс выгрузки пожарного десанта и процесс локализации низового лесного пожара соответственно; по идентификации и характеристике необходимого оборудования, используемого при локализации низового лесного пожара; по определению оптимального пути и количества сотрудников МЧС в составе пожарного десанта с помощью приведенного псевдокода.</p></sec><sec><title>Аналитическая часть</title><p>Аналитическая часть. Произведен обзор моделей, методов и алгоритмов поиска кратчайшего пути, оптими­зации, кольцевой маршрутизации транспорта. Поставлена некоторая задача тушения лесного пожара. Применение модифицированного метода Кларка – Райта, который учитывает возможность варьирования глубины сращивания маршрутов и определение оптимального значения вероятности осуществления ухудша­ющего шага, позволяет найти минимальные временные затраты авиалесоохраны на локализацию низового лесного пожара. Предоставлено решение задачи доставки пожарного десанта благодаря псевдокоду, реализующему базовый метод Кларка – Райта.</p></sec><sec><title>Выводы</title><p>Выводы. Решение на основе модифицированного метода Кларка – Райта предложит кольцевые авиамаршруты, которые будут закреплены за вертолетом, благодаря чему доставка пожарного десанта станет экономи­чески обоснованной. Результаты исследования будут полезны аналитикам и разработчикам про­­г­рам­­­­много обеспечения для осуществления деятельности авиалесоохраны.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Introduction</title><p>Introduction. The purpose of this study is to determine the minimum cost of a path to a standstill forest fire and its localization. To achieve this goal, it is necessary to perform the tasks of analyzing the selected method for calculating the minimum costs for the process of unloading a fire landing and the process of localization of a low forest fire accordingly; identifying and characterizing the necessary equipment used in localizing a low forest fire; on definition of the optimal way and the number of employees of the Ministry of Emergency Situations as part of a fire landing force using an algorithm in the form of a pseudocode.</p></sec><sec><title>The analytical part</title><p>The analytical part. The models, methods and algorithms of search of shortest way, optimization, circulation routing of transport are reviewed. Some problem of extinguishing of forest fire is set. The application of the modi­fied Clarke and Wright algorithm, which considers a possibility of variation of depth of route splice and definition of optimal value of probability of realization of the worsening step, makes it possible to find the minimum time spent by aviation forest protection for localization of a low forest fire. A solution to the problem of fire troop deli­very thanks to pseudocode implementing the basic Clarke and Wright algorithm is given.</p></sec><sec><title>Conclusions</title><p>Conclusions. The solution based on the modified Clarke and Wright algorithm provides circular air routes that will be assigned to a helicopter, so that the delivery of firefighting troops will become economically feasible. The results of the research will be useful to analysts and software developers for the implementation of aerial firefighting activities.</p></sec></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>lowland forest fire</kwd><kwd>aerial forest protection</kwd><kwd>firefighting</kwd><kwd>fire landing</kwd><kwd>transport routing</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">Beresneva E., Avdoshin S. Analysis of mathematical formulations of capacitated vehicle routing problem and methods for their solution // Proceedings of the Institute for System Programming of the RAS. 2018. Vol. 30. Issue 3. Pp. 233–250. DOI: 10.15514/ISPRAS-2018-30(3)-17</mixed-citation><mixed-citation xml:lang="en">Beresneva E., Avdoshin S. Analysis of mathema­tical formulations of capacitated vehicle routing problem and methods for their solution. Proceedings of the Institute for System Programming of the RAS. 2018; 30(3):233-250. DOI: 10.15514/ISPRAS-2018-30(3)-17</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Vega-Mejia C.A., Neira E.M.G., Montoya-Torres J.R., Islam S.M.N. Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints // International Journal of Industrial Engineering Computations. 2020. Vol. 11. Issue 2. Pp. 255–280. DOI: 10.5267/j.ijiec.2019.8.002</mixed-citation><mixed-citation xml:lang="en">Vega-Mejia C.A., Neira E.M.G., Montoya-Torres J.R., Islam S.M.N. Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints. International Journal of Industrial Engineering Computations. 2020; 11(2):255-280. DOI: 10.5267/j.ijiec.2019.8.002</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Achamu G., Berhan E. A classical heuristic algorithm implementation for logistic analysis of waste collection problem: a case of Addis Ababa Arada subicty // Journal of EEA. 2021. Vol. 39. Pp. 97–113.</mixed-citation><mixed-citation xml:lang="en">Achamu G., Berhan E. A classical heuristic algorithm implementation for logistic analysis of waste collection problem: a case of Addis Ababa Arada subicty. Journal of EEA. 2021; 39:97-113.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Kosasih W., Ahmad A., Laricha Salomon L., Febricky. Comparison study between nearest neighbor and farthest insert algorithms for solving VRP model using heuristic method approach // IOP Conference Series Materials Science and Engineering. 2020. Vol. 852. Issue 1. P. 012090. DOI: 10.1088/1757-899X/852/1/012090</mixed-citation><mixed-citation xml:lang="en">Kosasih W., Ahmad A., Laricha Salomon L., Febricky. Comparison study between nearest neighbor and farthest insertalgorithms for solving VRP model using heuristic method approach. IOP Conference Series Materials Science and Engineering. 2020; 852(1):012090. DOI: 10.1088/1757-899X/852/1/012090</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Коляда А.В. Оптимизация процессов тушения лесного пожара с использованием имитацион­ного моделирования // Ученые записки российского государственного социального университета. 2010. № 8. С. 89–94. URL: https://elibrary.ru/item.asp?id=17066620</mixed-citation><mixed-citation xml:lang="en">Kolyada A.V. Optimization of forest fire extinguishing processes using simulation modeling. Scientific Notes of the Russian State Social University. 2010; 8:89-94. URL: https://elibrary.ru/item.asp?id=17066620 (rus).</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Таранцев А.А., Чикитов Ю.И. Модель применения беспилотных летательных аппаратов в целях тушения крупных лесных пожаров в зоне применения наземных сил и средств // Вестник Санкт-Петербургского университета Государственной противопожарной службы МЧС России. 2016. № 2. С. 21–27. URL: https://elibrary.ru/item.asp?id=26183977</mixed-citation><mixed-citation xml:lang="en">Tarantsev A.A., Chekistov Yu.I. Model of the unmanned aerial vehicles applying in purpose of forest firefighting in ground forces zone. Bulletin of the St. Petersburg University of the State Fire Service of the Mini­stry of Emergency Situations of Russia. 2016; 2:21-27. URL: https://elibrary.ru/item.asp?id=26183977 (rus).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Бородин В.А., Кузовлев А.В., Харитонов А.А. Тактика тушения лесных пожаров // Пожарная безопасность: проблемы и перспективы. 2018. № 1 (8). С. 83–85. URL: https://elibrary.ru/item.asp?id=36576096</mixed-citation><mixed-citation xml:lang="en">Borodin V.A., Kuzovlev A.V., Kharitonov A.A. Forest fire extinguishing tactics. Fire safety: problems and prospects. 2018; 1(8):83-85. URL: https://elibrary.ru/item.asp?id=36576096 (rus).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Алаторцев А.С. Совершенствование организации тушения лесных пожаров в Самарской обла­сти : магистерская дис. Тольятти, 2017. 113 с.</mixed-citation><mixed-citation xml:lang="en">Alatortsev A.S. Improving the organization of extinguishing forest fires in the Samara region : master’s thesis in specialty. Togliatti, 2017; 113. (rus).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Pepper J., Golden B., Wasil E. Solving the traveling salesman problem with annealing-based heuristics: A computational study // IEEE Transactions on Systems, Man, and Cybernetics — Part A: Systems and Hum. 2002. Vol. 32. Issue 1. Pp. 72–77. DOI: 10.1109/3468.995530</mixed-citation><mixed-citation xml:lang="en">Pepper J., Golden B., Wasil E. Solving the traveling salesman problem with annealing-based heuristics: A computational study. IEEE Transactions on Systems, Man, and Cybernetics — Part A: Systems and Hum. 2002; 32(1):72-77. DOI: 10.1109/3468.995530</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Chandran B., Golden B., Wasil E. A computational study of three demon algorithm variants for solving the traveling salesman problem // Computational Modeling and Problem Solving in the Networked World. H.K. Barghava, N. Ye (eds). Boston : Kluwer Academic Publisher, MA, 2003. Pp. 155–175. DOI: 10.1007/978-1-4615-1043-7_8</mixed-citation><mixed-citation xml:lang="en">Chandran B., Golden B., Wasil E. A computational study of three demon algorithm variants for solving the traveling salesman problem. Computational Mo­delling and Problem Solving in the Networked World: Interfaces in Computer Science and Operations Research. Operations Research. H.K. Barghava, N. Ye (eds). Boston, Kluwer Academic Publisher, MA, 2003; 155-175. DOI: 10.1007/978-1-4615-1043-7_8</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Altinel I.K., Öncan T. A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem // Journal of the Operational Research Society. 2005. Vol. 56. Issue 8. Pp. 954–961. DOI: 10.1057/palgrave.jors.2601916</mixed-citation><mixed-citation xml:lang="en">Altinel I.K., Öncan T. A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society. 2005; 56(8):954-961. DOI: 10.1057/palgrave.jors.2601916</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Черепанов Д.А., Ермаков А.С. Экспертная оценка пожарного риска для кемпинга с применением матрицы последствий и вероятностей // Пожаровзрывобезопасность/Fire and Explosion Safety. 2017. Т. 26. № 2. С. 62–71. DOI: 10.18322/PVB.2017.26.02.62-71</mixed-citation><mixed-citation xml:lang="en">Cherepanov D.A., Ermakov A.S. Expert fire risk assessment camping with the use of a matrix of consequences and probability. Pozharovzryvobezopasnost/Fire and Explosion Safety. 2017; 26(2):62-71. DOI: 10.18322/PVB.2017.26.02.62-71 (rus).</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Швецов В.И. Математическое моделирование транспортных потоков // Автоматика и теле­механика. 2003. Вып. 11. С. 3–46. URL: https://www.mathnet.ru/php/getFT.phtml?jrnid=at&amp;paperid=1966&amp;what=fullt&amp;option_lang=rus</mixed-citation><mixed-citation xml:lang="en">Shvetsov V.I. Mathematical modeling of traffic flows. Automation and Remote Control. 2003; 11: 3-46. URL: https://www.mathnet.ru/php/getFT.phtml?jrnid=at&amp;paperid=1966&amp;what=fullt&amp;option_lang=rus (rus).</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Kristina S., Jason. Minimize transportation cost with Clark and Wright algorithm saving heuristic method with considering traffic congestion factor // IOP Conference Series: Materials Science and Engineering. 2019. Vol. 673. Issue 1. P. 012080. DOI: 10.1088/1757-899X/673/1/012080</mixed-citation><mixed-citation xml:lang="en">Kristina S., Jason. Minimize transportation cost with Clark and Wright algorithm savingheuristic method with considering traffic congestion factor. IOP Conference Series: Materials Science and Engineering. 2019; 673(1):012080. DOI: 10.1088/1757-899X/673/1/012080</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Никоноров В.М. Усовершенствование метода Кларка – Райта для решения задачи маршрутизации автомобильных мелкопартионных пере­возок // Научно-технические ведомости СПбГПУ. 2012. № 1. С. 295–298.</mixed-citation><mixed-citation xml:lang="en">Nikonorov V.M. Improvement of the Clark and Wright method for solving routing problems of small-party auto­mobile transportation. Scientific and Technical bulletin of SPbSTU. 2012; 1:295-298. (rus).</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Бронштейн Е.М., Зелев П.А. Об оптимальной доставке грузов транспортным средством с учетом стоимости перевозки от загрузки транспортного средства по нескольким циклическим маршрутам // Информатика и ее применения. 2014. Т. 8. № 4. С. 53–57. DOI: 10.14357/19922264140407 URL: https://elibrary.ru/item.asp?id=22846465</mixed-citation><mixed-citation xml:lang="en">Bronstein E.M., Zelev P.A. About optimum delivery of freights by the vehicle taking into account dependence of cost of transportations on loading of vehicles on several cyclic routes. Informatics and Applications. 2014; 8(4):53-57. DOI: 10.14357/19922264140407 URL: https://elibrary.ru/item.asp?id=22846465 (rus).</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Бронштейн Е.М., Зелев П.А. Задача маршрутизации транспортного средства с учетом зависимости стоимости перевозок от загрузки // Информационные технологии. 2014. № 4. С. 33–37.</mixed-citation><mixed-citation xml:lang="en">Bronstein E.M., Zelov P.A. The vehicle routing problem with the transportation cost dependence of vehicle loading. Information Technologies. 2014; 4:33-37. (rus).</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Зелев П.А., Бронштейн Е.М. Исследование эффективности модификаций алгоритма Кларка – Райта при решении задач доставки грузов // Информационные технологии интеллектуальной поддержки принятия решения : тр. IV Междунар. конф. Уфа, 2016. С. 94–97.</mixed-citation><mixed-citation xml:lang="en">Zelev P.A., Bronstein E.M. Investigation of the effectiveness of modifications of the Clark-Wright algorithm in solving cargo delivery problems : Proceedings of the fourth international conference “Information technologies of intellectual decision support”. Ufa, 2016; 94-97. (rus).</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Коробова Л.А., Зеленова Е.Е. Модификация алгоритма Кларка – Райта для оптимизации работы городской транспортной компании : мат. LV отчет. науч. конф. преподавателей и науч. сотрудников ВГУИТ за 2016 г. : в 3 ч. Ч. 2. / под ред. С.Т. Антипова. Воронеж : ВГУИТ, 2017. С. 111–114.</mixed-citation><mixed-citation xml:lang="en">Korobova L.A., Zelenova E.E. Modification of the Clark and Wright algorithm for optimizing the work of a city transport company : Materials of the LV repo­rting scientific conference of VSUIT teachers and researchers for 2016 : in 3 p. Part 2. S.T. Antipov (Ed.). Voronezh, VSUIT, 2017; 111-114. (rus).</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Арташес С. Исследование некоторых классических алгоритмов задачи маршрутизации транспорта // World Science. 2019. Vol. 1. Issue 3 (43). Pp. 10–14. DOI: 10.31435/rsglobal_ws/31032019/6398</mixed-citation><mixed-citation xml:lang="en">Artashes S. Investigation of some classical algorithms of the transport routing problem. World Science. 2019; 1(3):10-14. DOI: 10.31435/rsglobal_ws/31032019/6398 (rus).</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>
