Abstract
This paper presents the formulation and solution of a combined train routing and makeup, and empty car distribution model. This formulation results in a large scale mixed-integer programming problem with nonlinear objective function and linear constraints. A heuristic decomposition technique is developed to solve the model. This solution procedure exploits the special structure of the problem and decomposes it into smaller subproblems based on the type of decision variables. Model testing results are also presented.
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.
