On Modelling and Solving the Shortest Path Problem with Evidential Weights - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

On Modelling and Solving the Shortest Path Problem with Evidential Weights

Résumé

We study the single source single destination shortest path problem in a graph where information about arc weights is modelled by a belief function. We consider three common criteria to compare paths with respect to their weights in this setting: generalized Hurwicz, strong dominance and weak dominance. We show that in the particular case where the focal sets of the belief function are Cartesian products of intervals, finding best, i.e., non-dominated, paths according to these criteria amounts to solving known variants of the deterministic shortest path problem, for which exact resolution algorithms exist.
Fichier principal
Vignette du fichier
revision_22_review_modification.pdf (329.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03840632 , version 1 (05-11-2022)

Identifiants

Citer

Tuan-Anh Vu, Sohaib Afifi, Éric Lefèvre, Frédéric Pichon. On Modelling and Solving the Shortest Path Problem with Evidential Weights. 7th International Conference on Belief Functions 2022, Oct 2022, Paris, France. pp.139-149, ⟨10.1007/978-3-031-17801-6_14⟩. ⟨hal-03840632⟩

Collections

UNIV-ARTOIS LGI2A
11 Consultations
24 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More