License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.25
URN: urn:nbn:de:0030-drops-21848
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2184/
|
Go to the corresponding Portal |
Fügenschuh, Armin ;
Homfeld, Henning ;
Schuelldorf, Hanno
Routing Cars in Rail Freight Service
Abstract
Cars in rail freight services at Deutsche Bahn follow prescribed routes from their origin via intermediate shunting yards to their destination. The main goal in designing such routes is to reduce the number of trains and their travel distances. Various real-world capacity constraints make the problem difficult to formulate and also to solve. We present MILP and MINLP models for this problem based on multicommodity flows and arborescences. We compare these formulations using test- and real-world data.
BibTeX - Entry
@InProceedings{fugenschuh_et_al:DagSemProc.09261.25,
author = {F\"{u}genschuh, Armin and Homfeld, Henning and Schuelldorf, Hanno},
title = {{Routing Cars in Rail Freight Service}},
booktitle = {Models and Algorithms for Optimization in Logistics},
pages = {1--10},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9261},
editor = {Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2009/2184},
URN = {urn:nbn:de:0030-drops-21848},
doi = {10.4230/DagSemProc.09261.25},
annote = {Keywords: Mixed-Integer Programming, Branch-and-Cut, Logistics, Routing and Scheduling}
}
|
Keywords: |
|
Mixed-Integer Programming, Branch-and-Cut, Logistics, Routing and Scheduling |
|
Collection: |
|
09261 - Models and Algorithms for Optimization in Logistics |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
02.10.2009 |
