SODA

An Efficient MIP Model for Locomotive Scheduling with Time Windows

Aronsson, Martin and Kreuger, Per and Gjerdrum, Jonathan (2006) An Efficient MIP Model for Locomotive Scheduling with Time Windows. In: ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, 14-16 September 2006, Zürich.

Full text not available from this repository.

Official URL: http://drops.dagstuhl.de/opus/volltexte/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. Innovative features of the model include the use of boolean variables to separate the integer and continuous parts of the problem and maintaining the flow character of the integer part of the problem. The model has been developed with and has found practical use at Green Cargo, the largest freight rail operator in Sweden

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Vehicle routing and scheduling, rail traffic resource management, resource levelling
ID Code:451
Deposited By:IAM Researcher
Deposited On:22 Jan 2007
Last Modified:18 Nov 2009 15:56

Repository Staff Only: item control page