An optimization method of the multi-group train formation at flat yards

Козаченко, Дмитро Миколайович; Bobrovskiy, V. I.; Gera, Bogdan V.; Skovron, Ihor Ya.; Горбова, А. В.

doi:10.1080/23248378.2020.1732235

Cited by 12 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Xiao [14] established the comprehensive optimization model of the train formulation plan using both the single-block trains and two-block trains, aimed at the minimization of the total car-hour consumption at all yards. As for a discrete deterministic-controlled system that simulates the operation of the flat yard, Kozachenko [24] obtained a mathematical statement of the problem of choosing the optimal order of multi-group train formation. Lin [25] built a bi-level linear integer model to solve the train service network problem of the Chinese railway system.…”

Section: Literature Reviewmentioning

confidence: 99%

A Scheduling Approach for the Combination Scheme and Train Timetable of a Heavy-Haul Railway

Zhou

Guo

et al. 2021

Mathematics

View full text Add to dashboard Cite

Heavy-haul railway transport is a critical mode of regional bulk cargo transport. It dramatically improves the freight transport capacity of railway lines by combining several unit trains into one combined train. In order to improve the efficiency of the heavy-haul transport system and reduce the transportation cost, a critical problem involves arranging the combination scheme in the combination station (CBS) and scheduling the train timetable along the trains’ journey. With this consideration, this paper establishes two integer programming models in stages involving the train service plan problem (TSPP) model and train timetabling problem (TTP) model. The TSPP model aims to obtain a train service plan according to the freight demands by minimizing the operation cost. Based on the train service plan, the TTP model is to simultaneously schedule the combination scheme and train timetable, considering the utilization optimal for the CBS. Then, an effective hybrid genetic algorithm (HGA) is designed to solve the model and obtain the combination scheme and train timetable. Finally, some experiments are implemented to illustrate the feasibility of the proposed approaches and demonstrate the effectiveness of the HGA.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Scheduling Approach for the Combination Scheme and Train Timetable of a Heavy-Haul Railway

Zhou

Guo

et al. 2021

Mathematics

View full text Add to dashboard Cite

show abstract

“…The use of the criterion of minimum time expenditures instead of a minimum of the number of sorting operation stages or the number of cars being shunted results in a signifi cant complication of the optimization algorithms and increase in the duration of the search for a solution. Examples of such works are [4], where the time-optimal order of a multi-group train formation is determined by the statistical methods; [5], where the same problem is solved by the methods of graph theory; [6], where a special method based on a multilayer constructive model was developed to search for the optimal order of multi-group train formation.…”

Section: Information Technologies Systems Analysis and Administrationmentioning

confidence: 99%

Improvement of the method for standardizing the duration of rail cars shunting

Козаченко¹,

Gera²,

Manafov³

et al. 2021

Nauk. visn. nat. hirn. univ.

Self Cite

View full text Add to dashboard Cite

Purpose. To improve the method for calculating the time standard for shunting cars from track to track in order to take into account the local operating conditions of railway stations and railway sidings. Methodology. During the research, the methods of theory of railway operation were used. The problem of calculating the time standard for shunting operation was solved as the problem of searching the optimal division of train set into the car groups to achieve minimal time consumption for shunting operation. Findings. In the course of the study, the methods for calculating the time standards for initial and final operations, as well as movements performed when shunting cars from track to track were improved. It was proved that the minimum time spent on shunting cars from track to track was achieved when the train set was divided into the minimum possible number of parts and the cars were shunted in the longest possible groups and one remaining group. It was also established that with sufficient accuracy for engineering problems the duration of shunting train set from track to track can be represented by the piecewise linear function of the car number in it. Originality. The work originality consists in improving the method for calculating the time standard for shunting cars from track to track, that, unlike the existing one, takes into account the length limitations of the car groups being shunted from track to track, as well as the actual composition of operations performed in the process of shunting. Practical value. The use of the developed method allows setting time standards for shunting cars from track to track, taking into account the local operating conditions of railway stations and sidings of industrial enterprises. The method also makes it possible to simplify solving problems of searching the optimal order of performing more complex shunting operations, such as sorting cars into several tracks, collecting cars on one track, train formation, and others.

show abstract

“…Нами розглянуті нові завдання щодо застосування інтелектуальних процедур упорядкування, які орієнтовані на удосконалення технологій процесів розформування-формування (РФ) багатогрупових залізничних составів (БГС) на сортувальних станціях [3 -5]. Для вирішення проблем формування БГС були розроблені різноманітні підходи щодо застосування множини критеріїв оптимальності, розробки ефективних методів розрахунку показників і оптимізації процесів РФ [3,4]. Разом з тим в роботі [6] були відзначені певні обмеження переважної більшості відомих методів РФ.…”

Section: вступunclassified

“…Обчислити нові стани нейронів другого шару: Мережі Хопфілда, Хеммінга та інші дозволяють просто і ефективно вирішити задачу відтворення образів по неповній та спотвореній інформації, виконувати класифікацію таких даних, дозволяють проводити їх узагальнення. За допомогою мережі Хеммінга також можлива класифікація за критерієм максимальної правдоподібності [2,4]. Зазначені НМ дозволяють одноманітно вирішувати клас завдань формування варіантів рішень на основі методів інтелектуального управління.…”

Section:  unclassified

“…Щоби визначити операнди операцій із частинами составів (або вмісту зон ЗО () k Z ) будемо указувати початковий та кінцевій коди у атомарних групах. Так для коду составу (32/54/1/76) маємо такі операнди ((First1=3, Last1=2);(F2=5, L2=4) ;(F3=1, L3=1);( F4=7, L4=6)), або спрощено ((3, 2); (5,4); (1, 1);( 7,6)). Також операндами ОПУ можуть бути послідовності з кількох груп, наприклад ((F1=3, L2=4); (F3=1, L4=6)) та подібне.…”

Section: класифікації кодів станів процесу упорядкуванняunclassified

See 1 more Smart Citation

Intellectual Procedures for Ordering Sequence Orders by Inhomogeneous Forming Operators

Скалозуб¹,

Horiachkin²,

TERLETSKII³

2021

tstt

View full text Add to dashboard Cite

The researches results of discrete optimal planning problems of a wide range of production-technological, logistic and other service processes are presented. The planning methods are based on new intelligent procedures for ordering (IPO) sequences of elements (orders), which are implemented by means of constructive modeling. Purpose of procedures is to increase the efficiency of ordering receiving of orders, taking into account the complexity of the formation operations, as well as resource constraints. The article considers the models and methods of IPO application, which are focused on the processes of disbandment-formation (DF) of multigroup railway trains at sorting stations. Formally, such processes are represented by new models of ordering multi-sequences of orders taking into account the complexity of operations (OMSCE). In the search for optimal solutions, models of Hamming's associative memory are used, which allow to classify the current situations of OMSCE processes. In them, each class of certain states (taking into account the incompleteness and data perturbation) corresponds to one or more rational operators from among the possible ones. IPO procedures reduce the number of analysis options and increase the numerical efficiency of the optimizing multi-sequence orders method. The article presents the formalization of multilayer constructive models of OMSCE processes, intelligent procedures for methods of their implementation, the formation of the procedure for operations classification based on models of Hemming neural networks. At the same time, an improved structure of DF information technology with the use of intelligent procedures is also developed, examples of their application are given.

show abstract

An optimization method of the multi-group train formation at flat yards

Cited by 12 publications

References 11 publications

A Scheduling Approach for the Combination Scheme and Train Timetable of a Heavy-Haul Railway

A Scheduling Approach for the Combination Scheme and Train Timetable of a Heavy-Haul Railway

Improvement of the method for standardizing the duration of rail cars shunting

Intellectual Procedures for Ordering Sequence Orders by Inhomogeneous Forming Operators

Contact Info

Product

Resources

About