{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:22:53Z","timestamp":1758057773793,"version":"3.44.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032051783","type":"print"},{"value":"9783032051790","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"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-05179-0_14","type":"book-chapter","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T21:43:14Z","timestamp":1757972594000},"page":"179-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A MaxSAT Approach for\u00a0the\u00a0Train Timetabling Problem with\u00a0Route Choice and\u00a0Other Features"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1852-2782","authenticated-orcid":false,"given":"Filipe","family":"Gouveia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6439-1053","authenticated-orcid":false,"given":"Lu\u00eds","family":"Albino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7497-8085","authenticated-orcid":false,"given":"Ricardo L.","family":"Saldanha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"14_CR1","unstructured":"Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability, vol.\u00a0185. IOS press (2009)"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.trb.2009.07.007","volume":"44","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Scheduling extra freight trains on railway networks. Transp. Res. Part B: Methodol. 44(2), 215\u2013231 (2010)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"5","key":"14_CR3","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/opre.50.5.851.362","volume":"50","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50(5), 851\u2013861 (2002)","journal-title":"Oper. Res."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"100155","DOI":"10.1016\/j.ejtl.2025.100155","volume":"14","author":"PJ Correia Duarte","year":"2025","unstructured":"Correia Duarte, P.J., et al.: 50 years of or in railway timetabling and rolling stock planning. EURO J. Transp. Logist. 14, 100155 (2025)","journal-title":"EURO J. Transp. Logist."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Danavulapadu, V.P., Singamsetty, P.: Trains scheduling problem with multiple lines. Sci. Rep. 14(1) (2024)","DOI":"10.1038\/s41598-024-82499-0"},{"issue":"1\u20134","key":"14_CR6","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2(1\u20134), 1\u201326 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"14_CR7","unstructured":"Gattermann, P., Gro\u00dfmann, P., Nachtigall, K., Sch\u00f6bel, A.: Integrating passengers\u2019 routes in periodic timetabling: a SAT approach. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-31087-4_18","volume-title":"Advanced Research in Applied Artificial Intelligence","author":"P Gro\u00dfmann","year":"2012","unstructured":"Gro\u00dfmann, P., H\u00f6lldobler, S., Manthey, N., Nachtigall, K., Opitz, J., Steinke, P.: Solving periodic event scheduling problems with SAT. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.) IEA\/AIE 2012. LNCS (LNAI), vol. 7345, pp. 166\u2013175. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31087-4_18"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Jordi, J., Toletti, A., Caimi, G., Sch\u00fcpbach, K.: Applied timetabling for railways: experiences with several solution approaches (2019)","DOI":"10.29007\/w6vc"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.omega.2016.11.004","volume":"72","author":"L Lamorgese","year":"2017","unstructured":"Lamorgese, L., Mannino, C., Natvig, E.: An exact micro\u2013macro approach to cyclic and non-cyclic train timetabling. Omega 72, 59\u201370 (2017)","journal-title":"Omega"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1613\/jair.1.14924","volume":"79","author":"A Lemos","year":"2024","unstructured":"Lemos, A., Gouveia, F., Monteiro, P.T., Lynce, I.: Iterative train scheduling under disruption with maximum satisfiability. J. Artif. Intell. Res. 79, 1047\u20131090 (2024)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.ejor.2022.02.043","volume":"303","author":"F Leutwiler","year":"2022","unstructured":"Leutwiler, F., Corman, F.: A logic-based benders decomposition for microscopic railway timetable planning. Eur. J. Oper. Res. 303(2), 525\u2013540 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver\u2019. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-65340-2_29","volume-title":"Progress in Artificial Intelligence","author":"GP Matos","year":"2017","unstructured":"Matos, G.P., Albino, L., Saldanha, R.L., Morgado, E.M.: Optimising cyclic timetables with a SAT approach. In: Oliveira, E., Gama, J., Vale, Z., Lopes Cardoso, H. (eds.) EPIA 2017. LNCS (LNAI), vol. 10423, pp. 343\u2013354. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65340-2_29"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s12469-020-00244-y","volume":"13","author":"GP Matos","year":"2020","unstructured":"Matos, G.P., Albino, L.M., Saldanha, R.L., Morgado, E.M.: Solving periodic timetabling problems with sat and machine learning. Public Transp. 13(3), 625\u2013648 (2020)","journal-title":"Public Transp."},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N Tamura","year":"2008","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into sat. Constraints 14(2), 254\u2013272 (2008)","journal-title":"Constraints"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"103994","DOI":"10.1016\/j.trc.2022.103994","volume":"147","author":"E Wang","year":"2023","unstructured":"Wang, E., Yang, L., Li, P., Zhang, C., Gao, Z.: Joint optimization of train scheduling and routing in a coupled multi-resolution space\u2013time railway network. Transp. Res. Part C: Emerg. Technol. 147, 103994 (2023)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.trb.2016.10.010","volume":"94","author":"W Zhou","year":"2016","unstructured":"Zhou, W., Teng, H.: Simultaneous passenger train routing and timetabling using an efficient train-based Lagrangian relaxation decomposition. Transp. Res. Part B: Methodol. 94, 409\u2013439 (2016)","journal-title":"Transp. Res. Part B: Methodol."}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05179-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T21:43:15Z","timestamp":1757972595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05179-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"ISBN":["9783032051783","9783032051790"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05179-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,16]]},"assertion":[{"value":"16 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2025.ualg.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}