The Maximum Flow Problem for Oriented Flows

Please always quote using this URN: urn:nbn:de:0030-drops-65318
epub ahead of print
  • In several applications of network flows, additional constraints have to be considered. In this paper, we study flows, where the flow particles have an orientation. For example, cargo containers with doors only on one side and train coaches with 1st and 2nd class compartments have such an orientation. If the end position has a mandatory orientation, not every path from source to sink is feasible for routing or additional transposition maneuvers have to be made. As a result, a source-sink path may visit a certain vertex several times. We describe structural properties of optimal solutions, determine the computational complexity, and present an approach for approximating such flows.
Metadaten
Author:Stanley Schade, Martin Strehler
Editor:Marc Goerigk, Renato Werneck
Document Type:In Proceedings
Parent Title (English):16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)
Volume:54
First Page:1
Last Page:13
Series:OpenAccess Series in Informatics (OASIcs)
Publisher:Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication:Dagstuhl, Germany
Year of first publication:2016
Pagenumber:13
ISSN:2190-6807
ISBN:978-3-95977-021-7
Note:
Keywords: network flow with orientation, graph expansion, approximation, container logistics, train routing
URL:http://drops.dagstuhl.de/opus/volltexte/2016/6531
DOI:https://doi.org/10.4230/OASIcs.ATMOS.2016.7
Licence (German):License LogoCreative Commons - Namensnennung