An Efficient MIP Model for Locomotive Scheduling with Time Windows

Authors Martin Aronsson, Per Kreuger, Jonatan Gjerdrum

Thumbnail PDF


  • Filesize: 263 kB
  • 15 pages

Document Identifiers

Author Details

Martin Aronsson
Per Kreuger
Jonatan Gjerdrum

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)


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.
  • Vehicle routing and scheduling
  • rail traffic resource management
  • resource levelling


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail