{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T20:55:56Z","timestamp":1768251356819,"version":"3.49.0"},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP). To this end, we pursue a hybrid approach that extends ASP with difference constraints to account for a fine-grained timing. More precisely, we exemplarily show how the hybrid ASP system <jats:italic>clingo<\/jats:italic>[DL] can be used to tackle demanding planning and scheduling problems. In particular, we investigate how to boost performance by combining distinct ASP solving techniques, such as approximations and heuristics, with preprocessing and encoding techniques for tackling large-scale, real-world train-scheduling instances.<\/jats:p>","DOI":"10.1017\/s1471068420000046","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T11:19:53Z","timestamp":1587986393000},"page":"317-347","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":17,"title":["Train Scheduling with Hybrid Answer Set Programming"],"prefix":"10.1017","volume":"21","author":[{"given":"DIRK","family":"ABELS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JULIAN","family":"JORDI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAX","family":"OSTROWSKI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"TORSTEN","family":"SCHAUB","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AMBRA","family":"TOLETTI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4986-4881","authenticated-orcid":false,"given":"PHILIPP","family":"WANKO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2020,4,27]]},"reference":[{"key":"S1471068420000046_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000242"},{"key":"S1471068420000046_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000150"},{"key":"S1471068420000046_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20528-7_1"},{"key":"S1471068420000046_ref12","first-page":"1","volume-title":"Proceedings of the First Workshop on Grounding and Transformation for Theories with Variables (GTTV\u201911)","author":"Janhunen","year":"2011"},{"key":"S1471068420000046_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-012-9123-1"},{"key":"S1471068420000046_ref3","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","volume":"39","author":"Baptiste","year":"2012"},{"key":"S1471068420000046_ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.5.851.362"},{"key":"S1471068420000046_ref2","first-page":"212","volume-title":"Technical Communications of the Twenty-eighth International Conference on Logic Programming (ICLP\u201912)","author":"Andres","year":"2012"},{"key":"S1471068420000046_ref13","first-page":"23","volume-title":"Proceedings of the International Conference on Logic Programming (ICLP\u201999)","author":"Lifschitz","year":"1999"},{"key":"S1471068420000046_ref14","first-page":"32","volume-title":"Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR\u201912)","author":"Liu","year":"2012"},{"key":"S1471068420000046_ref15","unstructured":"Oliveira, E. and Smith, B. 2000. A job-shop scheduling model for the single-track railway scheduling problem. LU SCS RR 21, School of Computer Studies, University of Leeds."},{"key":"S1471068420000046_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"S1471068420000046_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"S1471068420000046_ref8","volume-title":"Technical Communications of the Thirty-Second International Conference on Logic Programming (ICLP\u201916)","author":"Gebser","year":"2016"},{"key":"S1471068420000046_ref7","volume-title":"Potassco User Guide","author":"Gebser","year":"2015"},{"key":"S1471068420000046_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.02.006"},{"key":"S1471068420000046_ref18","volume-title":"Proceedings of Fifth Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS\u201905)","author":"T\u00f6rnquist","year":"2006"},{"key":"S1471068420000046_ref10","first-page":"350","volume-title":"Proceedings of the Twenty-Seventh National Conference on Artificial Intelligence (AAAI\u201913)","author":"Gebser","year":"2013"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068420000046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T11:19:36Z","timestamp":1621595976000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000046\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,27]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["S1471068420000046"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000046","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,27]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}