An Efficient MIP Model for Locomotive Routing and Scheduling
Number of Authors: 3
2010 (English)Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2010, 9. 963-973 p.
Vehicle routing and scheduling, rail traffic resource management
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-23760OAI: oai:DiVA.org:ri-23760DiVA: diva2:1042837
Computers in Railways XII