SODA

MILP formulations of cumulative constraints for railway scheduling - A comparative study

Aronsson, Martin and Bohlin, Markus and Kreuger, Per (2009) MILP formulations of cumulative constraints for railway scheduling - A comparative study. In: 9th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS), 10 September 2009, Copenhagen, Denmark.

[img]
Preview
PDF - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

269Kb

Official URL: http://drops.dagstuhl.de/opus/volltexte/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.

Item Type:Conference or Workshop Item (Paper)
Additional Information:The Proceedings of the 9th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS) published by Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany
Uncontrolled Keywords:Railway transport scheduling, Cumulative scheduling, Mixed Integer Linear Programming (MILP) modelling and pre-processing
ID Code:3814
Deposited By:Per Kreuger
Deposited On:22 Feb 2010 11:36
Last Modified:12 Dec 2011 14:27

Repository Staff Only: item control page