\( \alpha \)-reliable shortest path problem in uncertain time-dependent networks

DOI10.1007/s40819-022-01351-zzbMath1494.90119OpenAlexW4283213431MaRDI QIDQ2149400

Sagarika Biswal, Ganesh Ghorai, Saraju P. Mohanty

Publication date: 28 June 2022

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-022-01351-z

zbMATH Keywords

Dijkstra's algorithmuncertain variabletravel timenon-dominated pathpre-trip planningreliable shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Finding reliable shortest paths in road networks under uncertainty
• Fuzzy shortest paths
• The fuzzy shortest path problem and its most vital arcs
• Fuzzy shortest path problems incorporating interactivity among paths.
• Theory and practice of uncertain programming
• An exact algorithm for the robust shortest path problem with interval data
• Uncertainty theory. An introduction to its axiomatic foundations.
• Determination of journeys order based on graph's Wiener absolute index with bipolar fuzzy information
• Certain indices of graphs under bipolar fuzzy environment with applications
• Shortest Paths in Probabilistic Graphs
• Coopetition bunch graphs: competition and cooperation on COVID19 research

This page was built for publication: \( \alpha \)-reliable shortest path problem in uncertain time-dependent networks