Abstract
Scheduling of railways is one of the NP-Hard problems which have been introduced more than two decades ago. Many mathematical models have been published for optimisation of the railways. However, none of those models can be applied to the Iranian Railway because of its specific situation regarding monorail routes, station capacity, etc. In this paper, a dynamic programming model has been introduced to schedule cargo trains based on the timetable of passenger trains that have priority in relation to cargo transportation. The objectives of this model are maximising the capacity of cargo train movement and minimising the stoppage time. It also considers several constraints including passenger train timetables, and the movement of only one train through a block at a time, etc. This model has been run in the Islamic Republic of Iran Railway Corporation and the results are presented in this paper.
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.
