OASIcs.ATMOS.2009.2141.pdf
- Filesize: 269 kB
- 13 pages
Document
MILP formulations of cumulative constraints for railway scheduling - A comparative study
Authors
-
Part of:
Volume:
9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (ATMOS 2009)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-11-25
Cite AsGet BibTex
Martin Aronsson, Markus Bohlin, and Per Kreuger. MILP formulations of cumulative constraints for railway scheduling - A comparative study. In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09). Open Access Series in Informatics (OASIcs), Volume 12, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/OASIcs.ATMOS.2009.2141
https://doi.org/10.4230/OASIcs.ATMOS.2009.2141
Abstract
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.
Keywords
- 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
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads