Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)

DOI: http://dx.doi.org/10.15439/2025F9016

Citation: Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS), M. Bolanowski, M. Ganzha, L. Maciaszek, M. Paprzycki, D. Ślęzak (eds). ACSIS, Vol. 43, pages 375–380 (2025)

Full text

Abstract. In this paper, we analyse rolling stock cyclic job scheduling problems with maintenance to maximize the total availability of vehicles or to minimize the total maintenance cost. The considered issues can be formulated as cyclic job scheduling problems on parallel machines with time and usage based deteriorating effects and maintenance. Since these problems are strongly NP-hard, we propose a dedicated double crossover genetic algorithm and compare its efficiency with other metaheuristics: particle swarm optimization, simulated annealing, and genetic algorithm (using a single crossover). The computational experiments reveal that our approach is robust, optimizes various instances, and overwhelms the other evaluated algorithms for the analysed scenarios correlated with real-life cases. Thus, our new method is applicable for the industrial practice to maximized availability of vehicles as well as to minimize maintenance costs.

References

1. M. Atsmony, B. Mor, and G. Mosheiov, “Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity,” Computers & Operations Research, vol. 152, p. 106133, 2023.
2. R. P. Nicolai and R. Dekker, “Optimal maintenance of multi-component systems: a review,” in Complex system maintenance handbook. London: Springer Science & Business Media, 2008, pp. 263–286.
3. X. Sun and X.-N. Geng, “Single-machine scheduling with deteriorating effects and machine maintenance,” International Journal of Production Research, vol. 57, pp. 3186–3199, 2019.
4. C. Zhang, Y. Gao, L. Yang, Z. Gao, and J. Qi, “Joint optimisation of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation,” Transportation Research Part B: Methodological, vol. 134, pp. 64–92, 2020.
5. R. Rudek and I. Rudek, “Models and algorithms for the preventive maintenance optimization of railway vehicles,” Expert Systems with Applications, vol. 240, pp. 122 589.1–13, 2024.
6. E. Eisenschmidt, S. Reimig, L. Schirmers, and S. Stern, “The rail sector’s changing maintenance game,” 2017, mcKinsey Global Institute, Report, https://tinyurl.com/ymbup3v5 [accessed: 2024-08-20].
7. R. Rudek, “A decision support system for rolling stock management in a railway transport company,” 2018, Industrial Report “Mozart Project” for Industrial Division Ltd., October 2017 – September 2018 (in Polish).
8. I. Rudek and R. Rudek, “Optimizing maintenance cost of uniform rolling stock by scheduling algorithms,” in Lecture Notes in Networks and Systems, L. Borzemski, H. Selvaraj, and J. Swiatek, Eds. Switzerland: Springer Nature, 2022, vol. 364, pp. 261–270.
9. I. Heppner and R. Rudek, “Improve railway vehicle availability by scheduling under preventive maintenance policies,” in 48th International Conference on Computers & Industrial Engineering 2018 (CIE48), X. Xun, M. I. Dessouky, and R. Y. Zhong, Eds. Computers and Industrial Engineering, 2018, pp. 2325–2332.
10. R. Rudek, “Local search algorithms for a railway scheduling problem under maintenance and cost criteria,” in Models and Methods for Systems Engineering. Studies in Big Data, G. Borowik, G. Chmaj, and R. Waszkowski, Eds. Cham: Springer, 2025, vol. 165, pp. 39–49, https://doi.org/10.1007/978-3-031-76440-0_4.
11. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer-Verlag, 1996.
12. R. Rudek, “A generic optimization framework for scheduling problems under machine deterioration and maintenance activities,” Computers & Industrial Engineering, vol. 174, pp. 108 800.1–22, 2022.