A multi-objective cargo train scheduling model: a mathematical approach

J. Razmi, M.S. Amalnik and B. Ostadi

International Journal of Management Practice, 2005, vol. 1, issue 4, 363-373

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.

Keywords: optimisation; dynamic programming; railways; cargo trains; scheduling; NP-hard; Iran. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=8071 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmpra:v:1:y:2005:i:4:p:363-373

Access Statistics for this article

More articles in International Journal of Management Practice from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().