2026-07-24T08:01:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2141 2024-03-06T10:28:40Z ddc:004 open_access

MILP formulations of cumulative constraints for railway scheduling - A comparative study Aronsson, Martin Bohlin, Markus Kreuger, Per Railway transport scheduling Cumulative scheduling Mixed Integer Linear Programming (MILP) modelling and pre-processing Railway transport scheduling Cumulative scheduling Mixed Integer Linear Programming (MILP) modelling and pre-processing This paper introduces two Mixed Integer Linear Programming (MILP) models for railway traffic planning using a cumulative scheduling constraint and associated pre-processing filters. We compare standard solver performance for these models on three sets of problems from the railway domain and for two of them, where tasks have unitary resource consumption, we also compare them with two more conventional models. In the experiments, the solver performance of one of the cumulative models is clearly the best and is also shown to scale very well for a large scale practical railway scheduling problem. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Aronsson and Markus Bohlin and Per Kreuger 2009 Is Part Of OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2009.2141 urn:nbn:de:0030-drops-21413 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2141 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode