Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14316
For citation please use:
Main Title: Shunting Minimal Rail Car Allocation
Author(s): Lübbecke, Marco E.
Zimmermann, Uwe T.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15543
http://dx.doi.org/10.14279/depositonce-14316
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We consider the rail car management at industrial in-plant railroads. Demands for loaded or empty cars are characterized by a track, a car type, and the desired quantity. If available, we assign cars from the stock, possibly substituting types, otherwise we rent additional cars. Transportation requests are fulfilled as a short sequence of pieces of work, the so-called blocks. Their design at a minimal total transportation cost is the planning task considered in this paper. It decomposes into the rough distribution of cars among regions, and the NP-hard shunting minimal allocation of cars per region. We present mixed integer programming formulations for the two problem levels. Our computational experience from practical data encourages an installation in practice.
Subject(s): mixed integer programming
shunting minimization
decomposition
rail transport
rail cars
Issue Date: 2004
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C11 Mixed integer programming
90C27 Combinatorial optimization
90B06 Transportation, logistics
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2004, 09
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-009-2004.pdf
Format: Adobe PDF | Size: 101.59 kB
DownloadShow Preview
Thumbnail
Report-009-2004.ps.gz
Format: Unknown | Size: 73.85 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.