TY - CHAP AU - Trautsch, László Kálmán ED - Vajk, István ED - Dunaev, Dmitriy TI - An Iterative Preprocessing Method and Constraint Programming Formulation for the Train Dispatching Problem T2 - Proceedings of the Automation and Applied Computer Science Workshop 2025 PB - Budapest University of Technology and Economics, Department of Automation and Applied Informatics CY - Budapest SN - 9789634219989 PY - 2025 SP - 56 EP - 67 PG - 12 UR - https://m2.mtmt.hu/api/publication/36377801 ID - 36377801 LA - English DB - MTMT ER - TY - CHAP AU - Trautsch, László Kálmán ED - Dunaev, Dmitriy ED - Vajk, István TI - Constraint Programming Formulation for a Complex Real-World Final Exam Scheduling Problem T2 - Proceedings of the Automation and Applied Computer Science Workshop 2024 : AACS'24 PB - Budapesti Műszaki Egyetem (BME) CY - Budapest SN - 9789634219606 PY - 2024 SP - 159 EP - 168 PG - 10 UR - https://m2.mtmt.hu/api/publication/35148380 ID - 35148380 LA - English DB - MTMT ER - TY - CONF AU - Trautsch, László Kálmán AU - Kővári, Bence András TI - Constraint Programming formulation for a real-world final exam scheduling problem with parallel sessions based on short time intervals T2 - VOCAL 2024 : 10th VOCAL Optimization Conference : Advanced Algorithms : Budapest, Hungary, June 5-7, 2024 PB - Magyar Operációkutatási Társaság C1 - Budapest SN - 9786150212210 PY - 2024 SP - 16 EP - 21 PG - 6 UR - https://m2.mtmt.hu/api/publication/35159506 ID - 35159506 LA - English DB - MTMT ER - TY - CHAP AU - Trautsch, László Kálmán AU - Kővári, Bence András ED - Ozcan, Ender ED - Stidsen, Thomas ED - Chiarandini, Marco TI - A Simulated Annealing Approach to the Multi-Activity Multi-Day Shift Scheduling Problem T2 - Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2024 PB - PATAT CY - [s.l.] SN - 9780992998462 PY - 2024 SP - 125 EP - 138 PG - 14 UR - https://m2.mtmt.hu/api/publication/35609353 ID - 35609353 N1 - This research was supported by the Ministry of Culture and Innovation and the National Research, Development and Innovation Office within the Cooperative Technologies National Laboratory of Hungary (Grant No. 2022- 2.1.1-NL2022-00012). AB - This paper addresses the multi-activity multi-day shift scheduling problem with a homogeneous workforce and quadratic cost function for overstaffing. The objective of this problem is to assign shifts to employees and activities within these shifts based on short time intervals, respecting numerous hard constraints and minimizing overstaffing. We propose a multi-neighborhood Simulated Annealing algorithm as a solution method, for which we introduce eight neighborhood relations. The search space and neighborhood relations are designed so that the search algorithm can be executed efficiently even on large problem instances. The method is evaluated on a benchmark dataset consisting of problem instances with varying complexity. The results show that our approach can handle even the most complex tasks and is able to find feasible solutions for 201 out of the 225 total problem instances, of which 99 were previously unsolved. Our method outperforms the solver that produced the previous best known solutions for the benchmark dataset and finds new best solutions for 190 of the instances. The algorithm can create good schedules in a matter of a few seconds, using limited computing resources. © 2024 PATAT. All Rights Reserved. LA - English DB - MTMT ER - TY - CHAP AU - Trautsch, László Kálmán AU - Erdős, Szilvia ED - Vajk, István ED - Dunaev, Dmitriy TI - A General Format for Graph-Based Modelling of Scheduling Problems T2 - Proceedings of the Automation and Applied Computer Science Workshop 2023 (AACS'23) PB - Budapesti Műszaki Egyetem, Automatizálási és Alkalmazott Informatikai Tanszék CY - Budapest SN - 9789634219262 PY - 2023 SP - 92 EP - 102 PG - 11 UR - https://m2.mtmt.hu/api/publication/34192705 ID - 34192705 LA - English DB - MTMT ER - TY - CONF AU - Trautsch, László Kálmán AU - Erdős, Szilvia TI - Egy általános gráf-alapú megközelítés munkavállalói ütemezési problémák modellezésére és előfeldolgozására T2 - XXXV. Magyar Operációkutatás Konferencia PB - Budapesti Corvinus Egyetem C1 - Budapest PY - 2023 SP - 76 EP - 76 PG - 1 UR - https://m2.mtmt.hu/api/publication/34200213 ID - 34200213 LA - English DB - MTMT ER - TY - CHAP AU - Trautsch, László Kálmán AU - Morvay, Balázs Tibor AU - Csikós, Marcell ED - Molnár, Dániel ED - Molnár, Dóra TI - IDENTIFYING DRUG INTERACTIONS WITH A VARIATIONAL GRAPH AUTO-ENCODER USING MISSING DATA IMPUTATION T2 - XXVI. Tavaszi Szél Konferencia 2023 PB - Doktoranduszok Országos Szövetsége (DOSZ) CY - Budapest SN - 9786156457370 PY - 2023 SP - 374 EP - 379 PG - 6 UR - https://m2.mtmt.hu/api/publication/34457490 ID - 34457490 LA - English DB - MTMT ER - TY - CONF AU - Trautsch, László Kálmán AU - Kővári, Bence András ED - Iványi, Péter TI - Solving a Final Exam Scheduling Problem with Constraint Programming T2 - Abstract book for the 19th MIKLÓS IVÁNYI INTERNATIONAL PHD & DLA SYMPOSIUM PB - Pollack Press C1 - Pécs SN - 9789636261825 PY - 2023 PG - 1 UR - https://m2.mtmt.hu/api/publication/34457300 ID - 34457300 LA - English DB - MTMT ER - TY - CHAP AU - Trautsch, László Kálmán AU - Erdős, Szilvia ED - Dunaev, Dmitriy ED - Vajk, István TI - State Space Modelling of a Final Exam Scheduling Problem T2 - Proceedings of the Automation and Applied Computer Science Workshop 2022 (AACS'22) PB - Budapesti Műszaki Egyetem, Automatizálási és Alkalmazott Informatikai Tanszék CY - Budapest SN - 9789634218753 PY - 2022 SP - 115 EP - 126 PG - 12 UR - https://m2.mtmt.hu/api/publication/33117870 ID - 33117870 LA - English DB - MTMT ER - TY - JOUR AU - Trautsch, László Kálmán AU - Erdős, Szilvia TI - Modelling different aspects of final exam scheduling problems for a graph-based state space reduction method JF - MULTIDISZCIPLINÁRIS TUDOMÁNYOK: A MISKOLCI EGYETEM KÖZLEMÉNYE J2 - MULTIDISZCIPLINÁRIS TUDOMÁNYOK VL - 12 PY - 2022 IS - 3 SP - 45 EP - 55 PG - 11 SN - 2062-9737 DO - 10.35925/j.multi.2022.3.5 UR - https://m2.mtmt.hu/api/publication/33757570 ID - 33757570 AB - Final exam scheduling is a subtopic of scheduling where various special requirements with different levels of strictness should be managed. The formalisation of these requirements can be a challenge in itself. The number of possible schedules that should be examined is usually large, so the state space is vast. However, many of these schedules can be excluded completely at an early stage based on their inconsistency with the hard requirements, thus reducing the state space. The modelling approach for different aspects of final exam scheduling problems is presented in this paper through the modelling of an actual, complex problem. The created model was used as the basis for a state space reduction method. The results show that the method could handle all the hard and soft constraints of the problem and reduce the state space significantly based on them. The modelling approach can be used for formalising the requirements of various final exam scheduling and similar problems. LA - English DB - MTMT ER -