Abstract
In this paper we describe a new model for the train unit shunting problem. This model is able to solve the matching and the parking subproblem in an integrated manner, usually requiring a reasonable amount of computation time for generating acceptable solutions. Furthermore, the model incorporates complicating details from practice, such as trains composed of several train units and shunt tracks that can be approached from two sides. Computation times are reduced by introducing the concept of virtual shunt tracks. Computational results are presented for real-life cases of NS Reizigers, the main Dutch passenger railway operator.
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.
