SODA

An Efficient MIP Model for Locomotive Routing and Scheduling

Aronsson, Martin and Kreuger, Per and Gjerdrum, Jonathan (2010) An Efficient MIP Model for Locomotive Routing and Scheduling. In: Computers in Railways XII, 2010, Beijing, China.

[img]
Preview
Postscript - Draft Version
Available under License Creative Commons Attribution Non-commercial Share Alike.

2854Kb

Official URL: http://library.witpress.com/pages/PaperInfo.asp?Pa...

Abstract

This paper presents a MIP model for a locomotive routing and scheduling problem from the domain of freight railways. Innovative features of the model include the use of binary variables to separate the integer and continuous parts of the problem to maintain the flow character of the integer part of the problem. The model has been developed with, and has found practical Green Cargo, the largest rail freight operator in Sweden.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Vehicle routing and scheduling, rail traffic resource management
ID Code:4028
Deposited By:Per Kreuger
Deposited On:04 Oct 2010 10:00
Last Modified:12 Dec 2011 14:15

Repository Staff Only: item control page