Abstract

In this paper we make computational experiments with an empty freight car distribution model. The model takes the limited transportation capacities of the trains into account, and it can be characterized as a multicommodity network flow model with integer requirements. The tests indicate that the model is solvable and that the model can be used for operational planning and strategic analyses.

Full Text
Paper version not known

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 call

Disclaimer: 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.