Universität zu Köln

Engels, Birgit and Schrader, Rainer (2015). Freight car dispatching with generalized flows. Networks, 66 (1). pp. 33-39. Wiley.

Preview

PDF revision_13032013.pdf - Draft Version Download (276kB) | Preview

Abstract

In the freight car dispatching problem empty freight cars have to be assigned to known demands respecting a given time horizon and certain constraints. The goal is to minimize the resulting transportation costs. One of the constraints is that customers can specify the type of cars they want. It is possible, however, that cars of certain types can be substituted by other cars, either in a 1-to-1 fashion or at different exchange rates. We show that these substitutions make the dispatching problem hard to solve and hard to approximate. We model the dispatching problem as an integral generalized transportation problem on a bipartite graph. Using rounding techniques, the LP-relaxation can be transformed to a transportation schedule violating some of the constraints slightly. Under an additional assumption on the cost function we fix this violation and derive a $4$-approximation of the problem.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Engels, Birgit UNSPECIFIED UNSPECIFIED UNSPECIFIED Schrader, Rainer UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-550522
Journal or Publication Title:	Networks
Volume:	66
Number:	1
Page Range:	pp. 33-39
Date:	2015
Publisher:	Wiley
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Uncontrolled Keywords:	Keywords Language ARRAY(0x55e933a683f8) UNSPECIFIED
Refereed:	No
URI:	http://kups.ub.uni-koeln.de/id/eprint/55052