Sökning: id:"swepub:oai:DiVA.org:ri-23631" >
MILP formulations o...
MILP formulations of cumulative constraints for railway scheduling - A comparative study
-
- Aronsson, Martin (författare)
- RISE,Decisions, Networks and Analytics lab,RISE., Decisions, Networks and Analytics lab
-
- Bohlin, Markus (författare)
- RISE,SICS,RISE - Research Institutes of Sweden (2017-2019), SICS, Sweden
-
- Kreuger, Per (författare)
- RISE,Decisions, Networks and Analytics lab,RISE., Decisions, Networks and Analytics lab
-
(creator_code:org_t)
- 13
- Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2009
- 2009
- Engelska.
-
Ingår i: The Proceedings of the 9th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS). - : Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
- Relaterad länk:
-
http://drops.dagstuh...
-
visa fler...
-
https://ri.diva-port... (primary) (Raw object)
-
https://urn.kb.se/re...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Railway transport scheduling
- Cumulative scheduling
- Mixed Integer Linear Programming (MILP) modelling and pre-processing
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)