Abstract
Consideration was given to the optimization model of assigning the locomotives to the freight trains. The model was formulated in terms of a dynamic problem of stochastic programming with probabilistic constraints. The state variables characterize positions of the locomotives and trains at each time instant. The variables defining the motion of locomotives and their assignment to trains at each time instant play the role of controls. The expectation of the total freight traffic is the criterial function of the problem. A two-stage hybrid algorithm to solve the problem was developed. It combines the coordinatewise search and a genetic algorithm. Results of the numerical experiment were given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
