In this paper we consider the problem of distributing empty freight cars in a railway polygon. We show how the process can be improved using an optimization model. The optimization model can be characterized as a combination of minimum-cost flow problem with vehicle routing problem. In general, problem of empty railroad car distribution between stations and definition of way-freight train route is presented as integer combinatorial optimization problem. Computational tests show that the model can be solved in acceptable time for real size problems, and indicate that the model generates distribution plans that can improve the quality of the planning process.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.