<?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">mirtr</journal-id><journal-title-group><journal-title xml:lang="ru">Мир транспорта</journal-title><trans-title-group xml:lang="en"><trans-title>World of Transport and Transportation</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1992-3252</issn><publisher><publisher-name>Russian University of Transport (RUT)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.30932/1992-3252-2016-14-4-2</article-id><article-id custom-type="elpub" pub-id-type="custom">mirtr-1976</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>THEORY</subject></subj-group></article-categories><title-group><article-title>Новые подходы к формированию транспортных расписаний</article-title><trans-title-group xml:lang="en"><trans-title>New Approaches to Development of Transport Schedules</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>Klevansky</surname><given-names>N. N.</given-names></name></name-alternatives><email xlink:type="simple">nklevansky@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>Antipov</surname><given-names>M. A.</given-names></name></name-alternatives><email xlink:type="simple">antipovmaxim@ya.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>Saratov State Agrarian University n. a. N. I. Vavilov</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2016</year></pub-date><pub-date pub-type="epub"><day>28</day><month>08</month><year>2016</year></pub-date><volume>14</volume><issue>4</issue><fpage>18</fpage><lpage>27</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Клеванский Н.Н., Антипов М.А., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Клеванский Н.Н., Антипов М.А.</copyright-holder><copyright-holder xml:lang="en">Klevansky N.N., Antipov M.A.</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://mirtr.elpub.ru/jour/article/view/1976">https://mirtr.elpub.ru/jour/article/view/1976</self-uri><abstract><p>Авторы статьи обосновывают выбор методов формирования расписания движения поездов дальнего следования на основе эвристических подходов и с учётом нецикличности пассажиро- и грузопотоков. В процессе алгоритмизации и разработки программного обеспечения для решения представленных задач используются концепции идеологии жадного алгоритма, загруженности и равномерности, целевого программирования в рамках требований системы управления безопасностью движения, ранжирования теории принятия решений. Двухэтапный процесс процедур включает формирование начального расписания и последующую его оптимизацию. Соответственно задачам предложены математическая модель и алгоритмы реализующих действий.</p></abstract><trans-abstract xml:lang="en"><p>The authors justify the choice of methods of developing schedules of long-distance trains on the basis of heuristic approaches and taking into account noncyclicity of passenger and freight flows in the Russian context. In the course of algorithmization and development of software for solutions of problems presented the concept of ideology of greedy algorithms, congestion and uniformity, target programming in the framework of requirements of traffic safety management system, ranking of decision-making theory are used. The two-stage process of procedures includes forming the initial schedule and its subsequent optimization. A mathematical model and algorithms of implementing actions are offered according to the objectives.</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>transport</kwd><kwd>timetable</kwd><kwd>schedule development</kwd><kwd>methodological approaches</kwd><kwd>heuristics</kwd><kwd>mathematical model</kwd><kwd>algorithms</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">Лазарев А . А ., Мусатова Е . Г ., Гафаров Е . Р ., Кварацхелия А . Г . Теория расписаний . Задачи управления транспортными системами . – М .: Физический факультет МГУ, 2012 . – 159 с.</mixed-citation><mixed-citation xml:lang="en">Lazarev, A . A ., Musatova, E . G ., Gafarov, E . R ., Kvaratshelia, A . G . Scheduling Theory . Tasks of transport system control [Teorija raspisanij. Zadachi upravlenija transportnymi sistemami] . Moscow, Faculty of Physics, Moscow State University, 2012, 159 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Peeters, L . Cyclic Railway Timetable Optimization, ERIM Ph .D . series Research in Management, Erasmus Research inst . of Management (ERIM), 2002.</mixed-citation><mixed-citation xml:lang="en">Peeters, L . Cyclic Railway Timetable Optimization, ERIM Ph .D . series Research in Management, Erasmus Research inst . of Management (ERIM), 2002.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Caprara, A ., Fischetti, M ., Toth, P . Modeling and solving the train timetabling problem, Operations Research, 2002, 50 (5), pp . 851–861.</mixed-citation><mixed-citation xml:lang="en">Caprara, A ., Fischetti, M ., Toth, P . Modeling and solving the train timetabling problem, Operations Research, 2002, 50 (5), pp . 851–861.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Fischer, F ., Helmberg, C ., Jansen, J ., Krostitz, B . Towards solving very large scale train timetabling problems by lagrangian relaxation, paper presented at the ATMOS2008 – 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Dagstuhl, Germany.</mixed-citation><mixed-citation xml:lang="en">Fischer, F ., Helmberg, C ., Jansen, J ., Krostitz, B . Towards solving very large scale train timetabling problems by Lagrangian relaxation, paper presented at the ATMOS2008 – 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Dagstuhl, Germany.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Cacchiani, V ., Caprara, A ., Toth, P . A column generation approach to train timetabling on a corridor, 2008, 4OR, 6 (2), pp . 125–142 .</mixed-citation><mixed-citation xml:lang="en">Cacchiani, V ., Caprara, A ., Toth, P . A column generation approach to train timetabling on a corridor, 2008, 4OR, 6 (2), pp . 125–142.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Burdett, R ., Kozan, E . A sequencing approach for creating new train timetables, OR Spectrum, 2010, 32 (1), pp . 163–193.</mixed-citation><mixed-citation xml:lang="en">Burdett, R ., Kozan, E . A sequencing approach for creating new train timetables, OR Spectrum, 2010, 32 (1), pp . 163–193.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Клеванский Н . Н . Основные концепции реализации задач формирования расписаний // Образовательные ресурсы и технологии . – 2014 . – № 2 . – С . 9–21.</mixed-citation><mixed-citation xml:lang="en">Klevansky, N . N . Main concepts of implementation of tasks of schedule formation [Osnovnye koncepcii realizacii zadach formirovanija raspisanij] . Obrazovatel’nye resursy i tehnologii, 2014, Iss . 2, pp . 9–21.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Клеванский Н . Н . Методы ранжирования в задачах формирования расписаний // Труды XII всероссийского совещания по проблемам управления – ВСПУ-2014 . – М ., 2014 . – С . 8040–8050.</mixed-citation><mixed-citation xml:lang="en">Klevansky, N . N . Methods of ranking in the tasks of schedule formation [Metody ranzhirovanija v zadachah formirovanija raspisanij] . Proceedings of the XII All-Russia meeting on management problems governance: VSPU –2014 . Moscow, 2014, pp . 8040–8050.</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>
