Least possible time paths in stochastic, time-varying networks.

DOI10.1016/S0305-0548(98)00027-6zbMath1042.90520WikidataQ127955804 ScholiaQ127955804MaRDI QIDQ1406727

Hani S. Mahmassani, Elise D. Miller-Hooks

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

shortest pathsStochastic dynamic networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items (15)

Optimal path problems with second-order stochastic dominance constraints ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ The dynamic shortest path problem with anticipation ⋮ A simulated annealing for multi-criteria network path problems ⋮ Time-dependent routing problems: a review ⋮ Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks ⋮ Least possible time paths in stochastic, time-varying networks. ⋮ Solving multi-objective optimization formulation for fleet planning in a railway industry ⋮ Optimising waiting at nodes in time-dependent networks: cost functions and applications ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge ⋮ A directed hypergraph model for random time dependent shortest paths ⋮ The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks ⋮ Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

Cites Work

• Unnamed Item
• Optimal paths in probabilistic networks: A case with temporary preferences
• Least possible time paths in stochastic, time-varying networks.
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Optimal paths in graphs with stochastic or multidimensional weights
• On a routing problem
• Shortest‐path methods: Complexity, interrelations and new propositions
• Shortest path methods: A unifying approach
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• Shortest paths in networks with exponentially distributed arc lengths
• The Stochastic Shortest Route Problem
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Application of a Technique for Research and Development Program Evaluation
• Shortest paths in stochastic networks with ARC lengths having discrete distributions
• Critical Path Analyses Via Chance Constrained and Stochastic Programming
• Shortest Paths in Probabilistic Graphs

This page was built for publication: Least possible time paths in stochastic, time-varying networks.