Full metadata record
DC FieldValueLanguage
dc.contributor.authorBuchholz, Peter-
dc.contributor.authorDohndorf, Iryna-
dc.description.abstractStochastic shortest path problems (SSPPs) have many applications in practice and are subject of ongoing research for many years. This paper considers a variant of SSPPs where times or costs to pass an edge in a graph are, possibly correlated, random variables. There are two general goals one can aim for, the minimization of the expected costs to reach the destination or the maximization of the probability to reach the destination within a given budget. Often one is interested in policies that build a compromise between different goals which results in multi-objective problems. In this paper, an algorithm to compute the convex hull of Pareto optimal policies that consider expected costs and probabilities of falling below given budgets is developed. The approach uses the recently published class of PH-graphs that allow one to map SSPPs, even with generally distributed and correlated costs associated to edges, on Markov decision processes (MDPs) and apply the available techniques for MDPs to compute optimal policies.en
dc.relation.ispartofseriesMath Meth Oper Res;93-
dc.subjectStochastic shortest path problemsen
dc.subjectMarkov decision processesen
dc.subjectPhase type distributionsen
dc.subjectPH graphsen
dc.subjectMulticriteria optimizationen
dc.titleA multi-objective approach for PH-graphs with applications to stochastic shortest pathsen
dcterms.accessRightsopen access-
eldorado.secondarypublication.primarycitationBuchholz, P., Dohndorf, I. A multi-objective approach for PH-graphs with applications to stochastic shortest paths. Math Meth Oper Res 93, 153–178 (2021).de
Appears in Collections:LS 04 Praktische Informatik

Files in This Item:
File Description SizeFormat 
Buchholz-Dohndorf2021_Article_AMulti-objectiveApproachForPH-.pdf959.79 kBAdobe PDFView/Open

This item is protected by original copyright

This item is licensed under a Creative Commons License Creative Commons