Optimizing Shunting Operations

Optimizing Shunting Operations: A case-study at Kijfhoek shunting yard

Druijf, Teun (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Optimization)

van Iersel, L.J.J. (mentor)
Brussen, M.F. (mentor)
Spaan, M.T.J. (graduation committee)

Delft University of Technology

Applied Mathematics | Optimization

2022-04-14

In the current economy, there is an increasing focus on sustainability. Green transport solutions, like rail freight, are becoming more and more popular. We will look into the shunting operations at Kijfhoek shunting yard. This yard functions as the central hub for DB Cargo Nederland and connects the Port of Rotterdam with the hinterland. About 2000 cars are sorted at this yard each week. At the yard, there are 43 parallel classification tracks.
Shunting problems come in many shapes and sizes but are generally hard to solve. To that end, we will use both exact algorithms and heuristics to solve the shunting problem at Kijfhoek within reasonable time. In practice, it is not known at the beginning of the planning horizon which cars will arrive. To that end, we will create general solutions which will be updated over time when new information becomes available. We test how well the solutions perform and/or can be reoptimized with the latest information using a simulator.
We find that our solution approaches can generate solutions for instances with 28 classification tracks of similar quality as solutions found for the same instances with 43 classification tracks with complete information at the beginning of the planning horizon. Furthermore, with incomplete information, we find good solutions with 32 classification tracks.

Shunting Operations
Integer Programming
Simulated Annealing
Simulation

http://resolver.tudelft.nl/uuid:e20191aa-4782-4686-85ae-5ff85adbf935

Student theses

master thesis

© 2022 Teun Druijf