Reliable and Restricted Quickest Path Problems

  • In a dynamic network, the quickest path problem asks for a path minimizing the time needed to send a given amount of flow from source to sink along this path. In practical settings, for example in evacuation or transportation planning, the reliability of network arcs depends on the specific scenario of interest. In this circumstance, the question of finding a quickest path among all those having at least a desired path reliability arises. In this article, this reliable quickest path problem is solved by transforming it to the restricted quickest path problem. In the latter, each arc is associated a nonnegative cost value and the goal is to find a quickest path among those not exceeding a predefined budget with respect to the overall (additive) cost value. For both, the restricted and reliable quickest path problem, pseudopolynomial exact algorithms and fully polynomial-time approximation schemes are proposed.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Stefan Ruzika, Markus Thiemann
URN (permanent link):urn:nbn:de:hbz:386-kluedo-16851
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (135)
Document Type:Report
Language of publication:English
Year of Completion:2011
Year of Publication:2011
Publishing Institute:Technische Universität Kaiserslautern
Tag:Dynamic Network Flows ; FPTAS ; Pseudopolynomial-Time Algorithm; Restricted Shortest Path
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $