<?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">kaz29</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Казахстанско-Британского технического университета</journal-title><trans-title-group xml:lang="en"><trans-title>Herald of the Kazakh-British Technical University</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6688</issn><issn pub-type="epub">2959-8109</issn><publisher><publisher-name>Казахстанско-Британский Технический Университет</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">kaz29-297</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>SMART SYSTEMS</subject></subj-group></article-categories><title-group><article-title>ОБЗОР РАЗЛИЧНЫХ ВИДОВ ЗАДАЧ МАРШРУТИЗАЦИИ ТРАНСПОРТА</article-title><trans-title-group xml:lang="en"><trans-title>OVERVIEW OF THE DIFFERENT TYPES OF VEHICLE ROUTING PROBLEM</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>A. A.</given-names></name><name name-style="western" xml:lang="en"><surname>Kuandykov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>д. т. н., профессор</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>Bayekova</surname><given-names>G. Ye.</given-names></name></name-alternatives><bio xml:lang="ru"><p>докторант</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Международный университет информационных технологий<country>Казахстан</country></aff><aff xml:lang="en">International University of Information Technologies<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2019</year></pub-date><pub-date pub-type="epub"><day>16</day><month>11</month><year>2021</year></pub-date><volume>16</volume><issue>3</issue><fpage>264</fpage><lpage>269</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Куандыков A.A., Баекова Г.Е., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Куандыков A.A., Баекова Г.Е.</copyright-holder><copyright-holder xml:lang="en">Kuandykov A.A., Bayekova 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.kbtu.edu.kz/jour/article/view/297">https://vestnik.kbtu.edu.kz/jour/article/view/297</self-uri><abstract><p>Логистика в современных условиях является одним из самых эффективных факторов повышения эффективности экономики. Как и другие традиционные функции управления, она ориентирована на перспективные информационные технологии, экономико-математические методы и модели обеспечения соответствия управленческих решении постоянно меняющимся внутренним и внешним условиям ведения бизнеса. В большей степени это относится к теории организации и функционирования логистических систем (процессов), участвующих в управлении материальными потоками и запасами, которые имеют тенденцию к постоянному росту. В настоящее время, в связи с увеличением грузопотоков, актуальной проблемой является разработка и развитие методов решения маршрутных задач, основной целью которых является снижение стоимости транспортировки и доставки различных грузов потребителям «точно в срок». В последние годы с развитием торговых сетей, ростом населения крупных городов, развитием транспортной инфраструктуры Казахстана, развитием новых эффективных информационно-вычислительных технологий для оптимизации структуры регионального транспорта становится все более распространенным явлением. Задача маршрутизации транспортных средств (ЗМТ) является одним из наиболее широко известных вопросов в классе задач комбинаторной оптимизации. Речь идет об оптимальном проектировании маршрутов, которые будут использоваться парком транспортных средств для обслуживания множества клиентов. ЗМТ напрямую связана с логистической транспортной проблемой, и она должна быть обобщением задачи коммивояжера (ЗК).</p></abstract><trans-abstract xml:lang="en"><p>Logistics in modern conditions is one of the most effective factors to improve the efficiency of the economy. Like other traditional management functions, it focuses on promising information technology, economic and mathematical methods and models to ensure compliance of management decisions constantly changing internal and external business conditions. To a greater extent, this is relevant for the theory of organization and functioning of logistics systems (processes) involved in the management of material flows and stocks, which tend to constant growth. Currently, due to the increase in freight traffic, an urgent problem is the development and development of methods for solving routing problems, the main purpose of which is to reduce the cost of transportation and delivery of various goods to consumers «just in time». In recent years, with the development of trade networks, the growth of the population of large cities, the development of transport infrastructure in Kazakhstan, the development of new effective information and computing technologies to optimize the structure of regional transport is becoming more widespread. Vehicle Routing Problem (VRP) is one of the most widely known questions in a class of combinatorial optimization problems. It is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. VRP is directly related to Logistics transportation problem and it is meant to be a generalization of the Travelling Salesman Problem (TSP).</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>Vehicle Routing Problem (VRP)</kwd><kwd>logistics</kwd><kwd>optimization problem</kwd><kwd>Travelling Salesman Problem (TSP)</kwd><kwd>mathematical formulation</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">Clarke, G., Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12 (4), 568581.</mixed-citation><mixed-citation xml:lang="en">Clarke, G., Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12 (4), 568581.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Dantzig, G. B., Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6 (1), 8091.</mixed-citation><mixed-citation xml:lang="en">Dantzig, G. B., Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6 (1), 8091.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Kosheev I. S. Optimization of delivery of cargo to consumers taking into account its placement in vehicles on the basis of heuristic methods // 2015 UFA</mixed-citation><mixed-citation xml:lang="en">Kosheev I. S. Optimization of delivery of cargo to consumers taking into account its placement in vehicles on the basis of heuristic methods // 2015 UFA</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Pojidaev M.S. Algoritmy resheniya zadachi marshrutizacii transporta. Diss.Tomsk, 2010. - 135 p.</mixed-citation><mixed-citation xml:lang="en">Pojidaev M.S. Algoritmy resheniya zadachi marshrutizacii transporta. Diss.Tomsk, 2010. - 135 p.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Toth, P., Vigo, D. (2014). Vehicle routing: Problems, Methods and Applications, Second Edition. Philadelphia: SIAM.</mixed-citation><mixed-citation xml:lang="en">Toth, P., Vigo, D. (2014). Vehicle routing: Problems, Methods and Applications, Second Edition. Philadelphia: SIAM.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Int. J. of Computers, Communications &amp; Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. VI (2011), No. 1 (March), pp. 158-165 // Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem P. C. Pop, C. Pop Sitar, I. Zelina, V Lupse, C. Chira</mixed-citation><mixed-citation xml:lang="en">Int. J. of Computers, Communications &amp; Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. VI (2011), No. 1 (March), pp. 158-165 // Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem P. C. Pop, C. Pop Sitar, I. Zelina, V Lupse, C. Chira</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Laporte, G. (2009). Fifty Years of Vehicle Routing. Transportation Science, 43 (4), 408416.</mixed-citation><mixed-citation xml:lang="en">Laporte, G. (2009). Fifty Years of Vehicle Routing. Transportation Science, 43 (4), 408416.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">C. Barnhart and G. Laporte (Eds.), Handbook in OR &amp; MS, Vol. 14 Copyright © 2007 Elsevier B. V All rights reserved DOI: 10.1016/S0927-0507(06)14006-2 // Chapter 6 Vehicle Routing Jean-Franc̦is Cordeau, Gilbert Laporte , Martin W. P. Savelsbergh , Daniele Vigo</mixed-citation><mixed-citation xml:lang="en">C. Barnhart and G. Laporte (Eds.), Handbook in OR &amp; MS, Vol. 14 Copyright © 2007 Elsevier B. V All rights reserved DOI: 10.1016/S0927-0507(06)14006-2 // Chapter 6 Vehicle Routing Jean-Franc̦is Cordeau, Gilbert Laporte , Martin W. P. Savelsbergh , Daniele Vigo</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Beresneva E., Avdoshin S. Analysis of Mathematical Formulations of Capacitated Vehicle Rout­ing Problem and Methods for their Solution. Trudy ISP RAN/Proc. ISP RAS, vol. 30, issue 3, 2018, pp, 233-250</mixed-citation><mixed-citation xml:lang="en">Beresneva E., Avdoshin S. Analysis of Mathematical Formulations of Capacitated Vehicle Rout­ing Problem and Methods for their Solution. Trudy ISP RAN/Proc. ISP RAS, vol. 30, issue 3, 2018, pp, 233-250</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Vasyanin V. A., Ushakova L. P. The task of building delivery and Assembly routes melkoprosejannyj of goods in the internal zones of the hierarchical road network</mixed-citation><mixed-citation xml:lang="en">Vasyanin V. A., Ushakova L. P. The task of building delivery and Assembly routes melkoprosejannyj of goods in the internal zones of the hierarchical road network</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>
