A Method for Optimization of Time Intervals between Rolling Cuts on Sorting Humps
| dc.contributor.author | Kozachenko, Dmytro M. | en |
| dc.contributor.author | Bobrovskyi, Volodymyr I. | en |
| dc.contributor.author | Demchenko, Yevhen B. | en |
| dc.date.accessioned | 2018-05-15T07:43:04Z | |
| dc.date.available | 2018-05-15T07:43:04Z | |
| dc.date.issued | 2018 | |
| dc.description | D. Kozachenko: ORCID 0000-0003-2611-1350; V. Bobrovskyi: ORCID 0000-0001-8622-2920; Е. Demchenko: ORCID 0000-0003-1411-6744 | en |
| dc.description.abstract | ENG: Abstract Sorting humps are the main technical means providing the breaking- and making-up of freight trains. Automation of sorting process by implementing microprocessor control systems is the main direction of increasing hump yard capacity, enhancement of safety in trains breaking-up, improvement of working conditions on hump yards. However, for wider introduction of such systems at the humps, it is necessary to reduce their cost. One of the main tasks of hump control systems is the determination of the optimal cars exit speeds from the retarders. Its solution is significantly complicated because of the uncertainty of cars rolling resistance coefficient, wind velocity and direction, retarder control errors. The paper is aimed at solving the problem of searching for such cars exit speeds from the retarders that provide the longest time intervals between them at the switches. Implementation of this method will make it possible to improve the quality of sorting process as a whole by improving the software of microprocessor control systems for automatic humping, rather than by increasing their technical facilities, which as a result will reduce the cost of their construction and operation. The research results, when solving the problem of searching for cars exit speeds from the retarders, allow us to move from searching for the maximum of a nonlinear non-smooth function of two variables to solution of an equation with one variable, which significantly accelerates and simplifies the solution to the problem. | en |
| dc.identifier | DOI: 10.1007/s40534-018-0161-2 | |
| dc.identifier.citation | Kozachenko, D. A Method for Optimization of Time Iintervals between Rolling Cuts on Sorting Humps / D. Kozachenko, V. Bobrovskyi, Y. Demchenko // Journal of Modern Transportation. – 2018. – Vol. 26, Iss. 3. – P. 189–199. – DOI: 10.1007/s40534-018-0161-2. | en |
| dc.identifier.issn | 2095-087X (Print) | |
| dc.identifier.issn | 2196-0577 (Online) | |
| dc.identifier.uri | http://eadnurt.diit.edu.ua/jspui/handle/123456789/10491 | en |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s40534-018-0161-2 | en |
| dc.language.iso | en | |
| dc.publisher | Springer, Heidelberg | en |
| dc.subject | railways | en |
| dc.subject | sorting hump | en |
| dc.subject | optimization | en |
| dc.subject | marshalling yard | en |
| dc.subject | КУЕР | uk_UA |
| dc.subject | КСВ | uk_UA |
| dc.title | A Method for Optimization of Time Intervals between Rolling Cuts on Sorting Humps | en |
| dc.type | Article | en |