PH-graphs for analyzing shortest path problems with correlated traveling times

DOI10.1016/J.COR.2015.01.001MaRDI QIDQ337529zbMATHOpenAlexFDO

Authors Peter Buchholz, Iryna Felko

Publication date 10 November 2016

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

Full work available at URL https://doi.org/10.1016/j.cor.2015.01.001

zbMATH Keywords

Markov decision processescorrelated edge weightsphase type distributionsstochastic shortest path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• Shortest paths in stochastic networks with correlated link costs
• A directed hypergraph model for random time dependent shortest paths
• scientific article; zbMATH DE number 4053318

Cites work

• scientific article; zbMATH DE number 1183924 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 2087798 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• A note on two problems in connexion with graphs
• A simple ant colony optimizer for stochastic shortest path problems
• A versatile Markovian point process
• An Analysis of Stochastic Shortest Path Problems
• Characterization of phase-type distributions
• Finite Continuous Time Markov Chains
• Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
• Improved results for route planning in stochastic transportation networks
• Matching More Than Three Moments with Acyclic Phase Type Distributions
• Matching Three Moments with Minimal Acyclic Phase Type Distributions
• Matrix‐analytic Models and their Analysis
• Numerical analysis of continuous time Markov decision processes over finite horizons
• Numerical transient analysis of Markov models
• Optimal control of diffusion processes with reflection
• Parallel iterative methods for sparse linear systems
• Phase-type distributions: open problems and a few properties
• Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
• Shortest paths in stochastic networks with correlated link costs
• Shortest paths without a map
• Simulation modeling and Arena
• Stochastic shortest path problems with recourse
• Stochastic shortest paths with recourse
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• The Markov-modulated Poisson process (MMPP) cookbook
• The Stochastic Shortest Route Problem
• Transformation of acyclic phase type distributions for correlation fitting

Cited in

(2)

• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights

Describes a project that uses

Uses Software

• PhFit
• OMNet++
• EMpht
• Profido

This page was built for publication: PH-graphs for analyzing shortest path problems with correlated traveling times

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