Volume 4, Issue 2 (10-2017)                   IJRARE 2017, 4(2): 11-22 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Khosravi Bizhaem A, Tamannaei M. Two Mathematical Models for Railway Crew Scheduling Problem. IJRARE 2017; 4 (2) :11-22
URL: http://ijrare.iust.ac.ir/article-1-170-en.html
Department of Transportation Engineering, Isfahan University of Technology
Abstract:   (1825 Views)
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new mathematical model to simultaneously minimize both costs of trips and transitions is proposed. Moreover, a new mathematical model is suggested to find the optimal solution of railway crew assignment problem. This model minimizes the total cost, including cost of assigning crew complements, fixed cost of employing crew complements and penalty cost for short workloads. To evaluate the proposed models, several random examples, based on the railway network of Iran are investigated. The results demonstrated the capability of the proposed models to decrease total costs of the crew scheduling problem.
Full-Text [PDF 390 kb]   (1040 Downloads)    
Type of Study: Research | Subject: Electrical railway

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2024 CC BY-NC 4.0 | International Journal of Railway Research

Designed & Developed by : Yektaweb