Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM68214
Volume:
10 |
10 |
Oct 2026
Pages:
1-6
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Computer Science and Engineering(Data Science)
Guru Nanak Institute of Technology, Nagpur
Computer Science and Engineering(Data Science)
Guru Nanak Institute of Technology, Nagpur
Computer Science and Engineering(Data Science)
Guru Nanak Institute of Technology, Nagpur
Computer Science and Engineering(Data Science)
Guru Nanak Institute of Technology, Nagpur
Computer Science and Engineering(Data Science)
Guru Nanak Institute of Technology, Nagpur
Electronics and Telecommunication
Guru Nanak Institute of Technology, Nagpur
A metro depot has a few hours between the last service of the day and the 05:30 hrs commencement to decide what sets to put on duties the next day forming the rolling stock induction plan, and what to send to maintenance bays to await stand-by. Many networks employ whiteboards, logbooks and spreadsheets to make this decision, taking into account a myriad of constraints like safety regulations, wheel and bogie replacements, advertiser contracts and the stabling yard layout simultaneously. In this paper we examine works on rail scheduling, constraint programming and predictive maintenance, comparing against a planner built for the 23-trainset fleet of Nagpur Metro Rail Corporation Limited. The system employs Google’s OR-Tools CP-SAT solver and supervised failure-risk model. For the two-line 6-bay 23-set problem the solver, including model build, took 23.5 ms on average and 30 ms at most over 13 stored plans, all proven optimal. Over 60-day simulations it reduced the mileage range across the fleet by 34.6% relative to a simulated manual baseline and violated no safety regulation in our tests. Works in the literature show the trend away from stand-alone dispatching tools towards systems which can demonstrate and justify their decisions. We identify areas for future work—yard sensing, rescheduling within the day, adaptation to other networks and energy-aware stabling.
KEYWORDS
Human heuristic operations within metro systems are nearing a tipping point both in the scale of the metro network and the complexity of the urban area. The Nagpur Metro case study shows that automated rostering with CP-SAT optimization and telemetry based risk assessment can produce dependable, auditable results in simulation without compromising the necessary safety headroom. The cases dealt with were strict safety based over-rided reasons (certificates, overhauls, Class-A defects) and there were no incidents on other criteria allowed for dynamic replanning within comparable limits within less than 30 ms of solver time in all the stored plans. This was achieved by an audit trail plus the written explanation and "what-if" analysis which led to the officer involvement being adequate without too many complicating factors: the officers assess the proposed plan, vote it through and approve for publication. An involved officer who understands the nuances of the case can question the suggestions made in a generic spreadsheet much better than a mere spreadsheet with figures. The future work on this topic could involve the adaptation to other networks and experimenting with the use of optical RFID readers to observe the consist information within the stabling bays. Another interesting avenue of future work would be energy-aware stabling to plan regeneration and battery thermal recovery for night storage thus allowing the metro concepts with batteries and no catenary to be shut down appropriately.
[1] The Metro Rail Guy, “Bids invited for Nagpur Metro Phase 2’s 48 coach contract RS-01,” Mar. 16, 2025. [Online]. Available: https://themetrorailguy.com/2025/03/16/bids-invited-for-nagpur-metro-phase-2s-48-coach-contract-rs-01/. Accessed: Oct. 19, 2026. [2] J.-F. Cordeau, F. Soumis, and J. Desrosiers, “Simultaneous assignment of locomotives and cars to passenger trains,” Oper. Res., vol. 49, no. 4, pp. 531–548, 2001. [3] G. Maróti and L. Kroon, “Maintenance routing for train units: The transition model,” Transp. Sci., vol. 39, no. 4, pp. 518–525, 2005. [4] P.-J. Fioole, L. Kroon, G. Maróti, and A. Schrijver, “A rolling stock circulation model for combining and splitting passenger train units,” Eur. J. Oper. Res., vol. 174, no. 2, pp. 1281–1297, 2006. [5] Q. Zhong, R. M. Lusby, J. Larsen, Y. Zhang, and Q. Peng, “Rolling stock scheduling with maintenance requirements at the Chinese high-speed railway,” Transp. Res. B, Methodol., vol. 126, pp. 24–44, 2019, doi: 10.1016/j.trb.2019.05.013. [6] D. Huisman, R. Freling, and A. P. M. Wagelmans, “Multiple-depot integrated vehicle and crew scheduling,” Transp. Sci., vol. 39, no. 4, pp. 491–502, 2005. [7] A. Caprara, L. Kroon, M. Monaci, M. Peeters, and P. Toth, “Passenger railway optimization,” in Handbooks in Operations Research and Management Science, vol. 14, C. Barnhart and G. Laporte, Eds. Amsterdam, The Netherlands: Elsevier, 2007, pp. 129–187, doi: 10.1016/S0927-0507(06)14003-7. [8] R. Freling, R. M. Lentink, L. G. Kroon, and D. Huisman, “Shunting of passenger train units in a railway station,” Transp. Sci., vol. 39, no. 2, pp. 261–272, 2005, doi: 10.1287/trsc.1030.0076. [9] J. T. Haahr, R. M. Lusby, and J. C. Wagenaar, “Optimization methods for the train unit shunting problem,” Eur. J. Oper. Res., vol. 262, no. 3, pp. 981–995, 2017. [10] N. Davari, B. Veloso, G. de A. Costa, P. M. Pereira, R. P. Ribeiro, and J. Gama, “A survey on data-driven predictive maintenance for the railway industry,” Sensors, vol. 21, no. 17, Art. no. 5739, 2021.
Publication Date
10/22/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
1
Total views since publication
PDF Downloads
6
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...