A directed hypergraph model for random time dependent shortest paths

DOI10.1016/S0377-2217(99)00259-3zbMath0967.90013MaRDI QIDQ1569934

Daniele Pretolani

Publication date: 9 July 2000

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

zbMATH Keywords

randomnetwork programmingshortest pathsdirected hypergraphstime-dependent

Mathematics Subject Classification ID

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

Related Items (20)

Random recursive hypergraphs ⋮ Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks ⋮ Effects of countdown displays in public transport route choice under severe overcrowding ⋮ Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ Flow hypergraph reducibility ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Optimal information location for adaptive routing ⋮ Finding the \(K\) shortest hyperpaths ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ 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 ⋮ Bicriterion Shortest Paths in Stochastic Time-Dependent Networks ⋮ Finding hypernetworks in directed hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Equilibrium traffic assignment for large scale transit networks
• Least possible time paths in stochastic, time-varying networks.
• Directed hypergraphs and applications
• 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
• Minimum weight paths in time-dependent networks
• An Analysis of Stochastic Shortest Path Problems
• Stochastic shortest path problems with recourse

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