{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:10:36Z","timestamp":1778213436862,"version":"3.51.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032236036","type":"print"},{"value":"9783032236043","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-23604-3_17","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:23:29Z","timestamp":1778210609000},"page":"266-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Genetic Algorithms with\u00a0Graph Neural Networks: A Timetabling Case Study"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1032-0924","authenticated-orcid":false,"given":"Laura-Maria","family":"Cornei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4468-3889","authenticated-orcid":false,"given":"Mihaela-Elena","family":"Breab\u0103n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Adam, S.P., Alexandropoulos, S.A.N., Pardalos, P.M., Vrahatis, M.N.: No free lunch theorem: a review. In: Approximation and optimization: Algorithms, Complexity and Applications, pp. 57\u201382 (2019)","DOI":"10.1007\/978-3-030-12767-1_5"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121868","volume":"238","author":"T Borgonjon","year":"2024","unstructured":"Borgonjon, T., Maenhout, B.: A genetic algorithm for the personnel task rescheduling problem with time preemption. Expert Syst. Appl. 238, 121868 (2024)","journal-title":"Expert Syst. Appl."},{"issue":"130","key":"17_CR3","first-page":"1","volume":"24","author":"Q Cappart","year":"2023","unstructured":"Cappart, Q., Ch\u00e9telat, D., Khalil, E.B., Lodi, A., Morris, C., Veli\u010dkovi\u0107, P.: Combinatorial optimization and reasoning with graph neural networks. J. Mach. Learn. Res. 24(130), 1\u201361 (2023)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR4","unstructured":"Curtois, T., Qu, R.: Computational results on new staff scheduling benchmark instances (2014)"},{"key":"17_CR5","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with Pytorch geometric (2019). https:\/\/pytorch-geometric.readthedocs.io\/en\/latest\/"},{"issue":"46","key":"17_CR6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2314092120","volume":"120","author":"D Gamarnik","year":"2023","unstructured":"Gamarnik, D.: Barriers for the performance of graph neural networks (GNN) in discrete random structures. Proc. Natl. Acad. Sci. 120(46), e2314092120 (2023)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"17_CR7","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2024). https:\/\/www.gurobi.com"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hafsa, M., Wattebled, P., Jacques, J., Jourdan, L.: A multi-objective evolutionary approach to professional course timetabling: a real-world case study. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 997\u20131004. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504797"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1111\/itor.13276","volume":"32","author":"M Hafsa","year":"2025","unstructured":"Hafsa, M., Wattebled, P., Jacques, J., Jourdan, L.: Solving a multiobjective professional timetabling problem using evolutionary algorithms at mandarine academy. Int. Trans. Oper. Res. 32(1), 244\u2013269 (2025)","journal-title":"Int. Trans. Oper. Res."},{"key":"17_CR10","unstructured":"Han, Q., et al.: A GNN-guided predict-and-search framework for mixed-integer linear programming (2023)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Holland, J.H.: Genetic algorithms and adaptation. In: Adaptive control of ill-defined systems, pp. 317\u2013333. Springer (1984)","DOI":"10.1007\/978-1-4684-8941-5_21"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Huang, P., Peng, Z., Li, Z., Peng, Q.: Solving the railway timetable rescheduling problem with graph neural networks. In: Railway Engineering Science, pp. 1\u201322 (2025)","DOI":"10.1007\/s40534-025-00383-7"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10729-022-09613-4","volume":"26","author":"KK Klyve","year":"2023","unstructured":"Klyve, K.K., Senthooran, I., Wallace, M.: Nurse rostering with fatigue modelling: Incorporating a validated sleep model with biological variations in nurse rostering. Health Care Manag. Sci. 26(1), 21\u201345 (2023)","journal-title":"Health Care Manag. Sci."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Lam, S.K., Pitrou, A., Seibert, S.: Numba: A LLVM-based python JIT compiler. In: Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC, pp.\u00a01\u20136 (2015)","DOI":"10.1145\/2833157.2833162"},{"key":"17_CR15","unstructured":"Lee, T.H., Kim, M.S.: RL-MILP Solver: a reinforcement learning approach for solving mixed-integer linear programs with graph neural networks. arXiv preprint arXiv:2411.19517 (2024)"},{"key":"17_CR16","unstructured":"Liu, Y., Zhang, P., Gao, Y., Zhou, C., Li, Z., Chen, H.: Combinatorial optimization with automated graph neural networks. arXiv preprint arXiv:2406.02872 (2024)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Liu, Y., Chen, X., Xu, Y., Xiang, D., Mo, L.: Accelerating model solving for integrated optimization of timetabling and vehicle scheduling based on graph convolutional network. In: 2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC), pp. 880\u2013886. IEEE (2023)","DOI":"10.1109\/ITSC57777.2023.10421897"},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1162\/evco.2008.16.3.315","volume":"16","author":"OJ Mengshoel","year":"2008","unstructured":"Mengshoel, O.J., Goldberg, D.E.: The crowding approach to niching in genetic algorithms. Evol. Comput. 16(3), 315\u2013354 (2008)","journal-title":"Evol. Comput."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Mohd\u00a0Razali, S.N.A.B., Tamilarasan, T.A.A., Basri, B.B., Bin\u00a0Arbin, N., et\u00a0al.: Maximizing shift preference for nurse rostering schedule using integer linear programming and genetic algorithm. Int. J. Adv. Comput. Sci. Appl. 16(5) (2025)","DOI":"10.14569\/IJACSA.2025.0160570"},{"key":"17_CR20","unstructured":"Nair, V., Alizadeh, M., et\u00a0al.: Neural large neighborhood search. In: Learning Meets Combinatorial Algorithms at NeurIPS2020 (2020)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"56504","DOI":"10.1109\/ACCESS.2022.3177280","volume":"10","author":"CM Ngoo","year":"2022","unstructured":"Ngoo, C.M., Goh, S.L., Sabar, N.R., Abdullah, S., Kendall, G., et al.: A survey of the nurse rostering solution methodologies: the state-of-the-art and emerging trends. IEEE Access 10, 56504\u201356524 (2022)","journal-title":"IEEE Access"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Nguyen, D.H., Truong, T.Q.A., Tran-Thanh, L.: Faster, larger, stronger: optimally solving employee scheduling problems with graph neural networks. In: International Symposium on Information and Communication Technology, pp. 141\u2013151. Springer (2024)","DOI":"10.1007\/978-981-96-4285-4_12"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Oberweger, F.F., Raidl, G.R., R\u00f6nnberg, E., Huber, M.: A learning large neighborhood search for the staff rerostering problem. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 300\u2013317. Springer (2022)","DOI":"10.1007\/978-3-031-08011-1_20"},{"key":"17_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.orhc.2023.100389","volume":"38","author":"R Otero-Caicedo","year":"2023","unstructured":"Otero-Caicedo, R., Casas, C.E.M., Jaimes, C.B., Garz\u00f3n, C.F.G., Vergel, E.A.Y., Vald\u00e9s, J.C.Z.: A preventive-reactive approach for nurse scheduling considering absenteeism and nurses\u2019 preferences. Operat. Res. Health Care 38, 100389 (2023)","journal-title":"Operat. Res. Health Care"},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1111\/itor.13298","volume":"32","author":"C Perreault-Lafleur","year":"2025","unstructured":"Perreault-Lafleur, C., Carvalho, M., Desaulniers, G.: A stochastic integer programming approach to reserve staff scheduling with preferences. Int. Trans. Oper. Res. 32(1), 289\u2013313 (2025)","journal-title":"Int. Trans. Oper. Res."},{"key":"17_CR26","unstructured":"Platten, B., Macfarlane, M., Graus, D., Mesbah, S.: Automated personnel scheduling with reinforcement learning and graph neural networks. In: HR@ RecSys (2022)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., Van Den\u00a0Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: European semantic web conference, pp. 593\u2013607. Springer (2018)","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Shi, Y., Huang, Z., Feng, S., Zhong, H., Wang, W., Sun, Y.: Masked label prediction: unified message passing model for semi-supervised classification, pp. 1548\u20131554 (2021)","DOI":"10.24963\/ijcai.2021\/214"},{"issue":"4","key":"17_CR29","doi-asserted-by":"publisher","first-page":"1869","DOI":"10.1007\/s12065-020-00438-0","volume":"14","author":"MH Tayarani-N","year":"2021","unstructured":"Tayarani-N, M.H.: Novel operators for quantum evolutionary algorithm in solving timetabling problem. Evol. Intel. 14(4), 1869\u20131893 (2021)","journal-title":"Evol. Intel."},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Thepphakorn, T., Pongcharoen, P., Vitayasak, S.: Multi-objective hybrid optimizations for designing course schedules based on operating costs and resource utilization. In: Annals of Operations Research, pp. 1\u201368 (2024)","DOI":"10.1007\/s10479-024-06363-0"},{"key":"17_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.seps.2022.101300","volume":"82","author":"AM Turhan","year":"2022","unstructured":"Turhan, A.M., Bilgen, B.: A mat-heuristic based solution approach for an extended nurse rostering problem with skills and units. Socioecon. Plann. Sci. 82, 101300 (2022)","journal-title":"Socioecon. Plann. Sci."},{"key":"17_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbi.2023.102538","volume":"79","author":"P Veli\u010dkovi\u0107","year":"2023","unstructured":"Veli\u010dkovi\u0107, P.: Everything is connected: graph neural networks. Curr. Opin. Struct. Biol. 79, 102538 (2023)","journal-title":"Curr. Opin. Struct. Biol."},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, e.a.S.: SciPy 1.0: fundamental algorithms for scientific computing in Python. Nat. Meth. 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"17_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108312","volume":"171","author":"Y Xu","year":"2022","unstructured":"Xu, Y., Wang, X.: A hybrid integer programming and artificial bee colony algorithm for staff scheduling in call centers. Comput. Ind. Eng. 171, 108312 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"17_CR35","doi-asserted-by":"publisher","first-page":"6472","DOI":"10.1109\/TITS.2023.3344468","volume":"25","author":"P Yue","year":"2024","unstructured":"Yue, P., Jin, Y., Dai, X., Feng, Z., Cui, D.: Reinforcement learning for scalable train timetable rescheduling with graph representation. IEEE Trans. Intell. Transp. Syst. 25(7), 6472\u20136485 (2024)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, X., Xu, Y., He, W., Guo, W., Cui, L.: A comprehensive review of the oversmoothing in graph neural networks. In: CCF Conference on Computer Supported Cooperative Work and Social Computing, pp. 451\u2013465. Springer (2023)","DOI":"10.1007\/978-981-99-9637-7_33"},{"issue":"9","key":"17_CR37","doi-asserted-by":"publisher","first-page":"6486","DOI":"10.1109\/TPAMI.2024.3382294","volume":"46","author":"P Zhou","year":"2024","unstructured":"Zhou, P., Xie, X., Lin, Z., Yan, S.: Towards understanding convergence and generalization of AdamW. IEEE Trans. Pattern Anal. Mach. Intell. 46(9), 6486\u20136493 (2024)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-23604-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:23:38Z","timestamp":1778210618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23604-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032236036","9783032236043"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23604-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}