Please use this identifier to cite or link to this item: http://lib.kart.edu.ua/handle/123456789/18005
Title: Formation of a model for the rational placement of cars with dangerous goods in a freight train
Authors: Lavrukhin, Oleksandr
Kovalov, Anton
Kulova, Daria
Panchenko, Artem
Keywords: dangerous goods
freight train
genetic algorithm
decision support system
Issue Date: 2019
Publisher: Elsevier Science Publishers
Citation: Lavrukhin O. Formation of a model for the rational placement of cars with dangerous goods in a freight train / O. Lavrukhin, A. Kovalov, D. Kulova, A. Panchenko // Procedia Computer Science. - 2019. - №149. - P. 28-35.
Abstract: The article deals with a scientific approach towards the target function generation of a mathematical model intended for an effective make-up of freight trains with wagons transporting dangerous goods. The model considered possible economic expenditures on making-up such trains and taking into account additional expenditures on rearrangement. It can be fulfilled at sorting stations and at any railway stations as well. The principle proposed can be applied on the territory of the CIS countries and on the territory of the member-states of the International Union of Railways. The academic value of the study lies in the fact that the target function suggests considering not only economic expenditures, but also ones for possible risks from transit of trains with dangerous goods under operational conditions. Considering the complexity of the model solution the authors propose the approach based on the genetic algorithm method; it allows obtaining efficient variants of freight train make-up in a comparatively short time. The approach can be further used as a computer-aided decision support system for operational staff on railway stations.
URI: http://lib.kart.edu.ua/handle/123456789/18005
ISSN: 1877-0509 (online)
Appears in Collections:2019

Files in This Item:
File Description SizeFormat 
Lavrukhin.pdf975.41 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.