A directed hypergraph model for random time dependent shortest paths

DOI10.1016/S0377-2217(99)00259-3MaRDI QIDQ1569934zbMATH OpenFDO

Authors D. Pretolani

Publication date 9 July 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00259-3

zbMATH Keywords

directed hypergraphsnetwork programmingrandomshortest pathstime-dependent

Mathematics Subject Classification ID

Hypergraphs (05C65) Stochastic network models in operations research (90B15)

Recommendations

• Bicriterion shortest hyperpaths in random time-dependent networks
• scientific article; zbMATH DE number 4053318
• Shortest paths in piecewise continuous time-dependent networks
• A random graph model driven by time-dependent branching dynamics
• scientific article; zbMATH DE number 1808552
• Bicriterion shortest paths in stochastic time-dependent networks
• Shortest Journeys in Directed Temporal Graphs
• Time version of the shortest path problem in a stochastic-flow network
• Dynamic single-source shortest paths in Erdős-Rényi random graphs

Cites work

• An Analysis of Stochastic Shortest Path Problems
• Directed hypergraphs and applications
• Equilibrium traffic assignment for large scale transit networks
• scientific article; zbMATH DE number 4112412 (Why is no real title available?)
• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• Least possible time paths in stochastic, time-varying networks.
• Minimum weight paths in time-dependent networks
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Stochastic shortest path problems with recourse

Cited in

(24)

• Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
• Multicriteria stochastic shortest path problem for electric vehicles
• Finding the K shortest hyperpaths
• Partially dynamic maintenance of minimum weight hyperpaths
• Finding hypernetworks in directed hypergraphs
• Finding the \(K\) best policies in a finite-horizon Markov decision process
• Dynamic graph generation for the shortest path problem in time expanded networks
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
• Multicriteria adaptive paths in stochastic, time-varying networks
• Ranking paths in stochastic time-dependent networks
• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
• Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks
• Effects of countdown displays in public transport route choice under severe overcrowding
• PH-graphs for analyzing shortest path problems with correlated traveling times
• Bicriterion shortest paths in stochastic time-dependent networks
• Bicriterion shortest hyperpaths in random time-dependent networks
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• On the complexity of strongly connected components in directed hypergraphs
• Optimal information location for adaptive routing
• Random recursive hypergraphs
• Fuzzy logic programs as hypergraphs. Termination results
• scientific article; zbMATH DE number 7716306 (Why is no real title available?)
• Flow hypergraph reducibility
• Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

This page was built for publication: A directed hypergraph model for random time dependent shortest paths

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