An Efficient MIP Model for Locomotive Scheduling with Time Windows

• 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

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Keyword

Vehicle routing and scheduling

rail traffic resource management

resource levelling

Publication and Content Type

ref (subject category)

kon (subject category)