Abstract

Passenger train timetables in Europe are often periodical and predetermined for longer periods of time to facilitate the planning of travel. Freight train schedules, however, depend on the actual demand. Therefore it is a common problem in railway systems to schedule additional freight train requests, under consideration of a given timetable for passenger trains. In this paper, we present a model for railway systems that allows us to solve this scheduling problem as a constrained time-dependent shortest path problem. We adapt and implement an algorithm to solve this type of problems, examine our results, and discuss possible modifications and extensions to this approach.

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.