## The Freight Train Routing Problem

Please always quote using this URN: urn:nbn:de:0297-zib-18991

- We consider the following freight train routing problem (FTRP). Given is a transportation network with fixed routes for passenger trains and a set of freight trains (requests), each defined by an origin and destination station pair. The objective is to calculate a feasible route for each freight train such that a sum of all expected delays and all running times is minimal. Previous research concentrated on microscopic train routings for junctions or inside major stations. Only recently approaches were developed to tackle larger corridors or even networks. We investigate the routing problem from a strategic perspective, calculating the routes in a macroscopic transportation network of Deutsche Bahn AG. Here macroscopic refers to an aggregation of complex real-world structures are into fewer network elements. Moreover, the departure and arrival times of freight trains are approximated. The problem has a strategic character since it asks only for a coarse routing through the network without the precise timings. We give a mixed-integer nonlinear programming~(MINLP) formulation for FTRP, which is a multi-commodity flow model on a time-expanded graph with additional routing constraints. The model's nonlinearities are due to an algebraic approximation of the delays of the trains on the arcs of the network by capacity restraint functions. The MINLP is reduced to a mixed-integer linear model~(MILP) by piecewise linear approximation. The latter is solved by a state of the art MILP solver for various real-world test instances.

Author: | Ralf BorndörferORCiD, Armin Fügenschuh, Torsten Klug, Thilo Schang, Thomas Schlechte, Hanno Schülldorf |
---|---|

Document Type: | ZIB-Report |

Tag: | Mixed-Integer Nonlinear Programming; freight train routing; multi-commodity flows |

MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING |

Date of first Publication: | 2013/07/19 |

Series (Serial Number): | ZIB-Report (13-36) |

Licence (German): | Creative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung |