<?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">seats</journal-id><journal-title-group><journal-title xml:lang="ru">Социально-экономические и технические системы: исследование, проектирование, оптимизация</journal-title><trans-title-group xml:lang="en"><trans-title>Social-economic and technical systems: research, design and optimization</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">1991-6302</issn><publisher><publisher-name>Казанский (Приволжский) федеральный университет</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">seats-4</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 application of graph theory in the construction of delivery routes for the scooter courier service in Naberezhnye Chelny</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>Doikov</surname><given-names>N. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Студент </p></bio><bio xml:lang="en"><p>student </p></bio><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>Boyko</surname><given-names>A. D.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Старший преподаватель </p></bio><bio xml:lang="en"><p>Senior Lecturer </p></bio><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>Naberezhnye Chelny Institute of the Kazan (Volga Region) Federal University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>22</day><month>10</month><year>2025</year></pub-date><volume>0</volume><issue>2</issue><issue-title>Спецвыпуск</issue-title><fpage>11</fpage><lpage>16</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дойков Н.С., Бойко А.Д., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Дойков Н.С., Бойко А.Д.</copyright-holder><copyright-holder xml:lang="en">Doikov N.S., Boyko A.D.</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://seats.elpub.ru/jour/article/view/4">https://seats.elpub.ru/jour/article/view/4</self-uri><abstract><p>В статье рассматривается применение теории графов для оптимизации маршрутов доставки курьерской службы «Самокат» в Набережных Челнах. Анализируются ключевые аспекты построения маршрутов с использованием графовых моделей, что позволяет существенно сократить время и затраты на доставку. Описывается метод, как алгоритм Дейкстры, который помогает находить наиболее эффективные пути. Также рассматривается пример реального сценария, где применение теории графов привело к улучшению логистики и повышению удовлетворенности клиентов.</p></abstract><trans-abstract xml:lang="en"><p>The article discusses the application of graph theory to optimize the delivery routes of the Scooter courier service in Naberezhnye Chelny. The key aspects of building routes using graph models are analyzed, which significantly reduces the time and cost of delivery. The method is described as Dijkstra's algorithm, which helps to find the most effective ways. An example of a real-world scenario is also considered, where the application of graph theory has led to improved logistics and increased customer satisfaction.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>теория графов</kwd><kwd>маршрутизация</kwd><kwd>оптимизация маршрутов</kwd><kwd>алгоритм Дейкстры</kwd><kwd>курьерская служба</kwd><kwd>эффективность доставки</kwd><kwd>графовые модели</kwd></kwd-group><kwd-group xml:lang="en"><kwd>graph theory</kwd><kwd>routing</kwd><kwd>route optimization</kwd><kwd>Dijkstra algorithm</kwd><kwd>courier service</kwd><kwd>efficient</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">Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., (2009). *Introduction to Algorithms*. MIT Press.</mixed-citation><mixed-citation xml:lang="en">Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., (2009). *Introduction to Algorithms*. MIT Press.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Winston, W.L. (2004). Operations Research: Applications and Algorithms*. Cengage Learning.</mixed-citation><mixed-citation xml:lang="en">Winston, W.L. (2004). Operations Research: Applications and Algorithms*. Cengage Learning.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Taha, H.A. (2017). *Operations Research: An Introduction*. Pearson.</mixed-citation><mixed-citation xml:lang="en">Taha, H.A. (2017). *Operations Research: An Introduction*. Pearson.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Dijkstra, E.W. (1959). “A note on two problems in connexion with graphs”. *Numerische Mathematik*, 1(1), 269-271.</mixed-citation><mixed-citation xml:lang="en">Dijkstra, E.W. (1959). “A note on two problems in connexion with graphs”. *Numerische Mathematik*, 1(1), 269-271.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Баранов А.В., Сидоров И.И. (2020). «Оптимизация логистических процессов на основе теории графов». *Журнал логистики*, 12(4), 45-58.</mixed-citation><mixed-citation xml:lang="en">Баранов А.В., Сидоров И.И. (2020). «Оптимизация логистических процессов на основе теории графов». *Журнал логистики*, 12(4), 45-58.</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>
