On modelling and solving the shortest path problem with evidential weights

DOI10.1007/978-3-031-17801-6_14MaRDI QIDQ6160930zbMATH OpenFDO

Authors Tuan-Anh Vu, Sohaib Afifi, Éric Lefèvre, Frédéric Pichon

Publication date 2 June 2023

Published in Belief Functions: Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

exact methodshortest pathbelief function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• Shortest paths with ordinal weights
• Shortest paths in fuzzy weighted graphs
• Shortest path problem with uncertain arc lengths
• Shortest path problems with partial information: Models and algorithms for detecting dominance
• Uncertain random shortest path problem

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An exact algorithm for the robust shortest path problem with interval data
• An exact method for the biobjective shortest path problem for large-scale road networks
• Approximately counting approximately-shortest paths in directed acyclic graphs
• Decision-making with belief functions: a review
• Improving and benchmarking of algorithms for \(\Gamma \)-maximin, \( \Gamma \)-maximax and interval dominance
• On the robust shortest path problem.
• Shortest path problems with partial information: Models and algorithms for detecting dominance
• Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
• The capacitated vehicle routing problem with evidential demands
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model

Cited in

(4)

• Shortest path problems with partial information: Models and algorithms for detecting dominance
• On the enumeration of non-dominated matroids with imprecise weights
• Optimization problems with evidential linear objective
• On the enumeration of non-dominated spanning trees with imprecise weights

This page was built for publication: On modelling and solving the shortest path problem with evidential weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160930)