Arc Reduction and Path Preference in Stochastic Acyclic Networks

The paper presents a heuristic for determining the path that maximizes the expected utility of a stochastic acyclic network. The focus is on shortest route problems where a general, nonlinear utility function is used to measure outcomes. For such problems, enumerating all feasible paths is the only...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Management Science. - Institute for Operations Research and the Management Sciences, 1954. - 37(1991), 2, Seite 198-215
1. Verfasser: Bard, Jonathan F. (VerfasserIn)
Weitere Verfasser: Bennett, James E.
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 1991
Zugriff auf das übergeordnete Werk:Management Science
Schlagworte:Stochastic Networks Shortest Path Problems Monte Carlo Simulation Utility Theory Mathematics Economics Behavioral sciences Applied sciences Philosophy Education