License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2006.683
URN: urn:nbn:de:0030-drops-6833
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/683/
Aronsson, Martin ;
Kreuger, Per ;
Gjerdrum, Jonatan
An Efficient MIP Model for Locomotive Scheduling with Time Windows
Abstract
This paper presents an IP model for a vehicle routing and scheduling
problem from the domain of freight railways. The problem is non-capacitated
but allows non-binary integer flows of vehicles between transports
with departure times variable within fixed intervals. The model has
been developed with and has found practical use at Green Cargo, the
largest freight rail operator in Sweden.
BibTeX - Entry
@InProceedings{aronsson_et_al:OASIcs:2006:683,
author = {Martin Aronsson and Per Kreuger and Jonatan Gjerdrum},
title = {{An Efficient MIP Model for Locomotive Scheduling with Time Windows}},
booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-01-9},
ISSN = {2190-6807},
year = {2006},
volume = {5},
editor = {Riko Jacob and Matthias M{\"u}ller-Hannemann},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2006/683},
URN = {urn:nbn:de:0030-drops-6833},
doi = {10.4230/OASIcs.ATMOS.2006.683},
annote = {Keywords: Vehicle routing and scheduling, rail traffic resource management, resource levelling}
}
|
Keywords: |
|
Vehicle routing and scheduling, rail traffic resource management, resource levelling |
|
Collection: |
|
6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) |
|
Issue Date: |
|
2006 |
|
Date of publication: |
|
29.08.2006 |
