DROPS

Document

DOI: 10.4230/OASIcs.ATMOS.2006.683

An Efficient MIP Model for Locomotive Scheduling with Time Windows

Authors: Martin Aronsson, Per Kreuger, and Jonatan Gjerdrum

Published in: OASIcs, Volume 5, 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (2006)

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.

Cite as

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)

Copy BibTex To Clipboard

@InProceedings{aronsson_et_al:OASIcs.ATMOS.2006.683,
  author =	{Aronsson, Martin and Kreuger, Per and Gjerdrum, Jonatan},
  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)},
  pages =	{1--15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-01-9},
  ISSN =	{2190-6807},
  year =	{2006},
  volume =	{5},
  editor =	{Jacob, Riko and M\"{u}ller-Hannemann, Matthias},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.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}
}

Search Results

Documents authored by Gjerdrum, Jonatan

An Efficient MIP Model for Locomotive Scheduling with Time Windows

Abstract

Cite as

Thanks for your feedback!

Could not send message