{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:36:57Z","timestamp":1772120217332,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Bane NOR"},{"DOI":"10.13039\/501100024102","name":"SINTEF","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100024102","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We consider the typical workflow of a route planner in the context of short-term train timetabling, that is, the incremental process of adjusting a timetable for the next day or up to the next year. This process usually alternates between (1) making rough modifications to an existing timetable (e.g., shifting the departure of a train by half an hour) and then (2) making small adjustments to regain feasibility (e.g., reduce or increase the dwell time of some trains in some stations). The most time-consuming element of this process is related to the second step, that is to manually eliminate all conflicts that may arise after a timetable has been modified. In this work, we propose a mixed-integer programming model tailored to solve precisely this problem, that is to find a conflict-free timetable that is as close as possible to a given one. Previous related work mostly focused on creating complex models to produce \u201coptimal\u201d timetables from scratch, which ultimately resulted in little to no practical applications. By using a simpler model, and by trusting route planners in steering the process towards a timetable with the desired qualities, we can get closer to handle real-life instances. The model has been integrated in a user interface that was tested and validated by Norwegian route planners to plan the yearly timetable of a busy railway line in Norway.<\/jats:p>","DOI":"10.1007\/s43069-023-00243-2","type":"journal-article","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T05:02:44Z","timestamp":1693371764000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Optimization-Based Decision Support Tool for Incremental Train Timetabling"],"prefix":"10.1007","volume":"4","author":[{"given":"Oddvar","family":"Kloster","sequence":"first","affiliation":[]},{"given":"Bj\u00f8rnar","family":"Luteberget","sequence":"additional","affiliation":[]},{"given":"Carlo","family":"Mannino","sequence":"additional","affiliation":[]},{"given":"Giorgio","family":"Sartor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"issue":"3","key":"243_CR1","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.ejor.2011.11.003","volume":"219","author":"V Cacchiani","year":"2012","unstructured":"Cacchiani V, Toth P (2012) Nominal and robust train timetabling problems. Eur J Oper Res 219(3):727\u2013737","journal-title":"Eur J Oper Res"},{"key":"243_CR2","doi-asserted-by":"crossref","unstructured":"Cacchiani V, Toth P (2018) Robust train timetabling. Handbook of Optimization in the Railway Industry, pp 93\u2013115","DOI":"10.1007\/978-3-319-72153-8_5"},{"issue":"4","key":"243_CR3","first-page":"285","volume":"6","author":"G Caimi","year":"2017","unstructured":"Caimi G, Kroon L, Liebchen C (2017) Models for railway timetable optimization: applicability and applications in practice. J Rail Transp Plan Manag 6(4):285\u2013312","journal-title":"J Rail Transp Plan Manag"},{"key":"243_CR4","doi-asserted-by":"crossref","unstructured":"Galli L, Stiller S (2018) Modern challenges in timetabling. Handbook of Optimization in the Railway Industry, pp. 117\u2013140","DOI":"10.1007\/978-3-319-72153-8_6"},{"issue":"2","key":"243_CR5","first-page":"85","volume":"17","author":"SS Harrod","year":"2012","unstructured":"Harrod SS (2012) A tutorial on fundamental model structures for railway timetable optimization. Surv Oper Res Manag Sci 17(2):85\u201396","journal-title":"Surv Oper Res Manag Sci"},{"issue":"3","key":"243_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s12469-015-0108-5","volume":"7","author":"M K\u00fcmmling","year":"2015","unstructured":"K\u00fcmmling M, Gro\u00dfmann P, Nachtigall K, Opitz J, Wei\u00df R (2015) A state-of-the-art realization of cyclic railway timetable computation. Public Transp 7(3):281\u2013293","journal-title":"Public Transp"},{"issue":"4","key":"243_CR7","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s00291-009-0189-0","volume":"33","author":"RM Lusby","year":"2011","unstructured":"Lusby RM, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: models and methods. OR Spectr 33(4):843\u2013883","journal-title":"OR Spectr"},{"issue":"2","key":"243_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s11750-008-0057-0","volume":"17","author":"E Castillo","year":"2009","unstructured":"Castillo E, Gallego I, Ure\u00f1a JM, Coronado JM (2009) Timetabling optimization of a single railway track line with sensitivity analysis. TOP 17(2):256\u2013287","journal-title":"TOP"},{"key":"243_CR9","unstructured":"Forsgren M, Aronsson M, Kreuger P, Dahlberg H (2011) The Maraca: a tool for minimizing resource conflicts in a non-periodic railway timetable. In: RailRome 2011"},{"key":"243_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 (2017) An exact micro-macro approach to cyclic and non-cyclic train timetabling. Omega 72:59\u201370","journal-title":"Omega"},{"issue":"10","key":"243_CR11","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.1016\/j.cor.2008.12.012","volume":"36","author":"SQ Liu","year":"2009","unstructured":"Liu SQ, Kozan E (2009) Scheduling trains as a blocking parallel-machine job shop scheduling problem. Comput Oper Res 36(10):2840\u20132852","journal-title":"Comput Oper Res"},{"issue":"11","key":"243_CR12","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1080\/03052151003596717","volume":"42","author":"L Yang","year":"2010","unstructured":"Yang L, Gao Z, Li K (2010) Passenger train scheduling on a single-track or partially double-track railway with stochastic information. Eng Optim 42(11):1003\u20131022","journal-title":"Eng Optim"},{"issue":"4","key":"243_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/03081060.2011.577151","volume":"34","author":"G Caimi","year":"2011","unstructured":"Caimi G, Laumanns M, Sch\u00fcpbach K, W\u00f6rner S, Fuchsberger M (2011) The periodic service intention as a conceptual framework for generating timetables with partial periodicity. Transp Plan Technol 34(4):323\u2013339","journal-title":"Transp Plan Technol"},{"issue":"1","key":"243_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/opre.2014.1327","volume":"63","author":"L Lamorgese","year":"2015","unstructured":"Lamorgese L, Mannino C (2015) An exact decomposition approach for the real-time train dispatching problem. Oper Res 63(1):48\u201364","journal-title":"Oper Res"},{"key":"243_CR15","doi-asserted-by":"publisher","first-page":"102798","DOI":"10.1016\/j.omega.2022.102798","volume":"116","author":"G Sartor","year":"2023","unstructured":"Sartor G, Mannino C, Nygreen T, Bach L (2023) A MILP model for quasi-periodic strategic train timetabling. Omega 116:102798","journal-title":"Omega"},{"issue":"1\u20132","key":"243_CR16","first-page":"2","volume":"4","author":"S de Fabris","year":"2014","unstructured":"de Fabris S, Longo G, Medeossi G, Pesenti R (2014) Automatic generation of railway timetables based on a mesoscopic infrastructure model. J Rail Transp Plan Manag 4(1\u20132):2\u201313","journal-title":"J Rail Transp Plan Manag"},{"issue":"3","key":"243_CR17","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143(3):498\u2013517","journal-title":"Eur J Oper Res"},{"issue":"2","key":"243_CR18","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 (2022) A logic-based benders decomposition for microscopic railway timetable planning. Eur J Oper Res 303(2):525\u2013540","journal-title":"Eur J Oper Res"},{"key":"243_CR19","doi-asserted-by":"crossref","unstructured":"Mannino CNakkerud A (2023) Optimal train rescheduling in Oslo central station. Omega 116(C)","DOI":"10.1016\/j.omega.2022.102796"},{"issue":"6","key":"243_CR20","doi-asserted-by":"publisher","first-page":"1586","DOI":"10.1287\/opre.2018.1837","volume":"67","author":"L Lamorgese","year":"2019","unstructured":"Lamorgese L, Mannino C (2019) A noncompact formulation for job-shop scheduling problems in traffic management. Oper Res 67(6):1586\u20131609","journal-title":"Oper Res"},{"key":"243_CR21","doi-asserted-by":"crossref","unstructured":"Sartor G, Mannino C, Bach L (2019) Combinatorial learning in traffic management. In: Machine Learning, Optimization, and Data Science: 5th International Conference, LOD 2019, Siena, Italy, September 10\u201313, 2019, Proceedings 5, pp. 384\u2013395. Springer","DOI":"10.1007\/978-3-030-37599-7_32"},{"key":"243_CR22","unstructured":"Gurobi Optimization (2023) LLC: Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"243_CR23","unstructured":"Bane NOR: Sprengt kapasitet p\u00e5 jernbanen fra Lysaker til Bod\u00f8. Accessed on July 4, 2023. https:\/\/www.banenor.no\/nyheter-og-aktuelt\/nyheter\/2023\/sprengt-kapasitet-pa-jernbanen-fra-lysaker-til-bodo\/"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00243-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00243-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00243-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T10:09:31Z","timestamp":1727172571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00243-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":23,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00243-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2625405\/v1","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"24 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"65"}}