{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:00:38Z","timestamp":1766221238577,"version":"3.48.0"},"reference-count":26,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Ensuring the smooth operation of a railway transport node, such as the maintenance depot, is highly demanding due to the complexity of the system. Many components are closely interconnected, and numerous constraints must be considered. Moreover, all workflow processes are frequently disrupted by a significant number of unexpected interruptions, such as delays, technical failures, or personnel shortages. These challenges highlight the necessity of optimizing both operational planning and real-time control. The field of operational research provides a wide range of optimization methods to improve efficiency in the management of railway transport nodes. However, exact mathematical models often prove unsuitable due to their computational complexity and the time required to obtain solutions, especially when dealing with large-scale operational problems. Instead, heuristic and metaheuristic approaches have emerged as practical alternatives, offering a balance between solution quality and computational time. One of the important aspects of depot management is the assignment of staff, particularly train drivers, to various tasks and activities. Efficient staff allocation is essential to minimize delays, optimize workload distribution, and reduce operational costs. In our research, we focus on two heuristic methods \u2013 SA and genetic algorithms \u2013 as potential tools for solving the driver assignment problem. These methods have demonstrated their effectiveness in achieving near-optimal solutions within a reasonable time frame, making them well-suited for real-world applications in railway maintenance depots.<\/jats:p>","DOI":"10.1515\/comp-2025-0037","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T15:17:01Z","timestamp":1756221421000},"source":"Crossref","is-referenced-by-count":0,"title":["Applying metaheuristic methods for staffing in railway depots"],"prefix":"10.1515","volume":"15","author":[{"given":"Andrea","family":"Galad\u00edkov\u00e1","sequence":"first","affiliation":[{"name":"Faculty of Management Science and Informatics, University of \u017dilina , \u017dilina , Slovak Republic"}]},{"given":"Maro\u0161","family":"Janovec","sequence":"additional","affiliation":[{"name":"Faculty of Management Science and Informatics, University of \u017dilina , \u017dilina , Slovak Republic"}]},{"given":"Branislav","family":"\u010casnocha","sequence":"additional","affiliation":[{"name":"Faculty of Management Science and Informatics, University of \u017dilina , \u017dilina , Slovak Republic"}]}],"member":"374","published-online":{"date-parts":[[2025,8,26]]},"reference":[{"key":"2025122008514897394_j_comp-2025-0037_ref_001","doi-asserted-by":"crossref","unstructured":"I. F. L\u00f6v\u00e9tei, L. Lindenmaier, and S. Aradi, \u201cEfficient real-time rail traffic optimization: Decomposition of rerouting, reordering, and rescheduling problems,\u201d Journal of Rail Transport Planning and Management, vol. 3, p. 100496, 2025.","DOI":"10.1016\/j.jrtpm.2024.100496"},{"key":"2025122008514897394_j_comp-2025-0037_ref_002","doi-asserted-by":"crossref","unstructured":"M. Fischetti and M. Monaci, \u201cUsing a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling,\u201d European Journal of Operational Research, vol. 263, pp. 258\u2013264, 2017.","DOI":"10.1016\/j.ejor.2017.04.057"},{"key":"2025122008514897394_j_comp-2025-0037_ref_003","doi-asserted-by":"crossref","unstructured":"P. Arsalani, M. Reisi-Nafchi, V. Dardashti, and G. Moslehi, \u201cTwo new mixed-integer programming models for the integrated train formation and shipment path optimization problem,\u201d Networks, vol. 81, pp. 359\u2013377, 2023.","DOI":"10.1002\/net.22133"},{"key":"2025122008514897394_j_comp-2025-0037_ref_004","doi-asserted-by":"crossref","unstructured":"D. Arenas, P. Pellegrini, S. Hanafi, and J. Rodriguez, \u201cTimetable rearrangement to cope with railway maintenance activities,\u201d Computers and Operations Research, vol. 95, pp. 123\u2013138, 2018.","DOI":"10.1016\/j.cor.2018.02.018"},{"key":"2025122008514897394_j_comp-2025-0037_ref_005","doi-asserted-by":"crossref","unstructured":"P. Pellegrini, G. Marli\u00e0re, R. Pesenti, and J. Rodriguez, \u201cRecife-MILP: An effective MILP-based heuristic for the real-time railway traffic management problem,\u201d IEEE Transactions on Intelligent Transportation Systems, 16, no. 5, 2609\u20132619, 2015.","DOI":"10.1109\/TITS.2015.2414294"},{"key":"2025122008514897394_j_comp-2025-0037_ref_006","doi-asserted-by":"crossref","unstructured":"Y. Zhang, A. D\u2019Ariano, B. Hee, and Q. Peng, \u201cMicroscopic optimization model and algorithm for integrating train timetabling and track maintenance task scheduling,\u201d Transportation Research Part B, vol. 127, pp. 237\u2013278, 2019.","DOI":"10.1016\/j.trb.2019.07.010"},{"key":"2025122008514897394_j_comp-2025-0037_ref_007","doi-asserted-by":"crossref","unstructured":"G. Ayd\u0131n, and I. \u015eahin, \u201c A mixed integer linear programming model with heuristic improvements for single-track railway rescheduling problem,\u201d Applied Sciences, vol. 13, no. 2, p. 696, 2023.","DOI":"10.3390\/app13020696"},{"key":"2025122008514897394_j_comp-2025-0037_ref_008","doi-asserted-by":"crossref","unstructured":"I. Rudek and R. Rudek, \u201cHeuristic workload scheduling algorithms for rolling stocks with mixed preventive maintenance policies,\u201d In: 2021 25th International Conference on Methods and Models in Automation and Robotics (MMAR), pp. 297\u2013302, 2021.","DOI":"10.1109\/MMAR49549.2021.9528452"},{"key":"2025122008514897394_j_comp-2025-0037_ref_009","doi-asserted-by":"crossref","unstructured":"T. Xia, L. Wang, W. Liu, Q. Zhang, J.-X. Dong, and X. Zhu, \u201cTrain assignment and handling capacity arrangement in multi-yard railway container terminals: An enhanced adaptive large neighborhood search heuristic approach,\u201d Computers and Industrial Engineering, vol. 198, p. 110733, 2024.","DOI":"10.1016\/j.cie.2024.110733"},{"key":"2025122008514897394_j_comp-2025-0037_ref_010","doi-asserted-by":"crossref","unstructured":"R. Garc\u00eda-R\u00f3denas, M. L. L\u00e1pez-Garc\u00eda, L. Cadarso, and E. Codina, \u201cAn efficient greedy heuristic for the real-time train platforming problem,\u201d Computers & Operations Research, vol. 164, p. 106525, 2024.","DOI":"10.1016\/j.cor.2023.106525"},{"key":"2025122008514897394_j_comp-2025-0037_ref_011","doi-asserted-by":"crossref","unstructured":"B. Pascariu, M. Sam\u00e0, P. Pellegrini, A. D\u2019Ariano, J. Rodriguez, and D. Pacciarelli, \u201cEffective train routing selection for real-time traffic management: Improved model and ACO parallel computing,\u201d Computers & Operations Research, vol. 145, p. 105859, 2022.","DOI":"10.1016\/j.cor.2022.105859"},{"key":"2025122008514897394_j_comp-2025-0037_ref_012","doi-asserted-by":"crossref","unstructured":"J. Eaton and S. Yang, \u201cRailway platform reallocation after dynamic perturbations using ant colony optimisation,\u201d in 2016 IEEE Symposium Series on Computational Intelligence, 2016.","DOI":"10.1109\/SSCI.2016.7849965"},{"key":"2025122008514897394_j_comp-2025-0037_ref_013","doi-asserted-by":"crossref","unstructured":"K. Nitisiri, M. Gen, and H. Ohwada, \u201cA parallel multi-objective GA with learning based mutation for railway scheduling,\u201d Computers and Industrial Engineering, vol. 130, pp. 381\u2013394, 2019.","DOI":"10.1016\/j.cie.2019.02.035"},{"key":"2025122008514897394_j_comp-2025-0037_ref_014","doi-asserted-by":"crossref","unstructured":"C. Sanhueza, A. Mendes, M. Jackson, and R. Clement, \u201cAn efficient GA for the train scheduling problem with fleet management,\u201d In: 2020 IEEE Congress on Evolutionary Computation, 2020.","DOI":"10.1109\/CEC48606.2020.9185779"},{"key":"2025122008514897394_j_comp-2025-0037_ref_015","doi-asserted-by":"crossref","unstructured":"C. E. A. Zhang, \u201cTrain rescheduling for large-scale disruptions in a large-scale railway network,\u201d Transportation Research Part B: Methodological, vol. 174, p. 102786, 2023.","DOI":"10.1016\/j.trb.2023.102786"},{"key":"2025122008514897394_j_comp-2025-0037_ref_016","doi-asserted-by":"crossref","unstructured":"X. Xu and M. Dessouky, \u201cTrain shunting with service scheduling in a high-speed railway depot,\u201d Transportation Research Part C, vol. 143, p. 103819, 2022.","DOI":"10.1016\/j.trc.2022.103819"},{"key":"2025122008514897394_j_comp-2025-0037_ref_017","doi-asserted-by":"crossref","unstructured":"C. E. A. Xiu, \u201cPassenger service-oriented timetable rescheduling for large-scale disruptions in a railway network: A heuristic-based alternating direction method of multipliers,\u201d Omega (United Kingdom), vol. 125, pp. 103040, 2024.","DOI":"10.1016\/j.omega.2024.103040"},{"key":"2025122008514897394_j_comp-2025-0037_ref_018","doi-asserted-by":"crossref","unstructured":"V. Cacchiani, F. Furini, and M. P. Kidd, \u201cApproaches to a real-world train timetabling problem in a railway node,\u201d Omega, vol. 58, pp. 97\u2013110, 2016.","DOI":"10.1016\/j.omega.2015.04.006"},{"key":"2025122008514897394_j_comp-2025-0037_ref_019","doi-asserted-by":"crossref","unstructured":"W. Chen, Q. Zhuo, and L. Zhang, \u201cModeling and heuristically solving group train operation scheduling for heavy-haul railway transportation,\u201d Mathematics, vol. 11, pp. 2489, 2023.","DOI":"10.3390\/math11112489"},{"key":"2025122008514897394_j_comp-2025-0037_ref_020","doi-asserted-by":"crossref","unstructured":"L. Kang and X. Zhu, \u201cA SA algorithm for first train transfer problem in urban railway networks,\u201d Applied Mathematical Modelling, vol. 40, no. 1, pp. 419\u2013435, 2016.","DOI":"10.1016\/j.apm.2015.05.008"},{"key":"2025122008514897394_j_comp-2025-0037_ref_021","doi-asserted-by":"crossref","unstructured":"M. Yaghini, M. Momeni, and M. Sarmadi, \u201cSolving train formation problem using SA algorithm in a simplex framework,\u201d Journal of Advanced Transportation, vol. 48, pp. 402\u2013416, 2014.","DOI":"10.1002\/atr.1183"},{"key":"2025122008514897394_j_comp-2025-0037_ref_022","doi-asserted-by":"crossref","unstructured":"A. Galad\u00edkov\u00e1 and N. Adamko, Simulation-based optimization of personnel assignment in railway nodes In: 2022 IEEE 16th International Scientific Conference on Informatics (Informatics), pp. 1\u20136, 2022.","DOI":"10.1109\/Informatics57926.2022.10083470"},{"key":"2025122008514897394_j_comp-2025-0037_ref_023","doi-asserted-by":"crossref","unstructured":"P. J. M. Laarhoven and E. H. L. Aarts, Simulated annealing: Theory and application, Springer, Eindhoven, 1987.","DOI":"10.1007\/978-94-015-7744-1"},{"key":"2025122008514897394_j_comp-2025-0037_ref_024","doi-asserted-by":"crossref","unstructured":"K. Man, K. Tang, and S. Kwong, \u201cGenetic algorithms: concepts and applications [in engineering design],\u201d IEEE Transactions on Industrial Electronics, vol. 43, no. 5, pp. 519\u2013534, 1996.","DOI":"10.1109\/41.538609"},{"key":"2025122008514897394_j_comp-2025-0037_ref_025","doi-asserted-by":"crossref","unstructured":"N. Adamko and V. Klima, \u201cOptimisation of railway terminal design and operations using villon generic simulation model,\u201d Transport, vol. 23, no. 4, pp. 335\u2013340, 2008.","DOI":"10.3846\/1648-4142.2008.23.335-340"},{"key":"2025122008514897394_j_comp-2025-0037_ref_026","doi-asserted-by":"crossref","unstructured":"A. Galad\u00edkov\u00e1 and B. \u00c7asnocha, \u201cUsing SA for personnel assignment in railway nodes,\u201d in 2024 IEEE 17th International Scientific Conference on Informatics (Informatics), pp. 1\u20136, 2024.","DOI":"10.1109\/Informatics62280.2024.10900767"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0037\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0037\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:58:36Z","timestamp":1766221116000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0037\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,1]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,9,17]]},"published-print":{"date-parts":[[2025,9,17]]}},"alternative-id":["10.1515\/comp-2025-0037"],"URL":"https:\/\/doi.org\/10.1515\/comp-2025-0037","relation":{},"ISSN":["2299-1093"],"issn-type":[{"type":"electronic","value":"2299-1093"}],"subject":[],"published":{"date-parts":[[2025,1,1]]},"article-number":"20250037"}}