Criteria for the \textit{a priori} shortest path generation in uncertain time-varying transportation networks

DOI10.1142/S021848851550035XMaRDI QIDQ4600490zbMATH OpenOpenAlexFDO

Authors Li Wang, Li-Xing Yang, Ziyou Gao

Publication date 11 January 2018

Published in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021848851550035x

zbMATH Keywords

deterministic dominance rulefirst-order uncertain dominance ruleuncertain expected value dominance ruleuncertain time-varying network

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Recommendations

• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Least expected time paths in stochastic, time-varying transportation networks
• Ranking paths in stochastic time-dependent networks
• Bicriterion shortest paths in stochastic time-dependent networks
• Multicriteria adaptive paths in stochastic, time-varying networks

Cited in

(2)

• The constrained shortest path problem with stochastic correlated link travel times
• Theory and Applications of Models of Computation

This page was built for publication: Criteria for the \textit{a priori} shortest path generation in uncertain time-varying transportation networks

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