Heuristic for finding reliable and robust paths in dynamic networks

In this paper we propose an new heuristic criterion to determine the most critical arc of a robust path in a semi dynamic graph. A robust path is defined as a collection of deviation paths covering the critical arcs. This heuristic rely on arcs fault probabilities to determine which arc of the robus...

Full description

Saved in:
Bibliographic Details
Published inIFAC Proceedings Volumes Vol. 43; no. 8; pp. 77 - 81
Main Authors Goessen, C., Habbas, Z., Khadraoui, D.
Format Journal Article
LanguageEnglish
Published 2010
Subjects
combinatorial problems
fault tolerance
graph algorithms
combinatorial problems
fault tolerance
graph algorithms
Online AccessGet full text

Cover

More Information
Summary:In this paper we propose an new heuristic criterion to determine the most critical arc of a robust path in a semi dynamic graph. A robust path is defined as a collection of deviation paths covering the critical arcs. This heuristic rely on arcs fault probabilities to determine which arc of the robust path is the most critical. We experimentaly compare this heuristic with others criterions.
ISSN:1474-6670
DOI:10.3182/20100712-3-FR-2020.00014