OASIcs.ATMOS.2006.683.pdf
- Filesize: 263 kB
- 15 pages
Document
An Efficient MIP Model for Locomotive Scheduling with Time Windows
Authors
-
Part of:
Volume:
6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (ATMOS 2006)
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: 2006-08-29
Cite AsGet BibTex
Martin Aronsson, Per Kreuger, and Jonatan Gjerdrum. An Efficient MIP Model for Locomotive Scheduling with Time Windows. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/OASIcs.ATMOS.2006.683
https://doi.org/10.4230/OASIcs.ATMOS.2006.683
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.
Keywords
- Vehicle routing and scheduling
- rail traffic resource management
- resource levelling
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads