Arc Reduction and Path Preference in Stochastic Acyclic Networks

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
LEADER 01000caa a22002652 4500
001 JST056289863
003 DE-627
005 20240622022116.0
007 cr uuu---uuuuu
008 150324s1991 xx |||||o 00| ||eng c
035 |a (DE-627)JST056289863 
035 |a (JST)2632391 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Bard, Jonathan F.  |e verfasserin  |4 aut 
245 1 0 |a Arc Reduction and Path Preference in Stochastic Acyclic Networks 
264 1 |c 1991 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a 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 way to guarantee that the global optimum has been found. Alternatively, we develop a reduction algorithm based on stochastic dominance to speed up the computations. Monte Carlo simulation is used to evaluate the approach. In all, 70 test problems comprising 20 to 60 nodes are randomly generated and analyzed. The results indicate that the heuristic produces significant computational saving as the size of the network grows, and that the quality of the reduced network solutions are better than those obtained from the original formulation. 
540 |a Copyright 1991 The Institute of Management Sciences 
650 4 |a Stochastic Networks 
650 4 |a Shortest Path Problems 
650 4 |a Monte Carlo Simulation 
650 4 |a Utility Theory 
650 4 |a Mathematics  |x Pure mathematics  |x Probability theory  |x Random variables 
650 4 |a Economics  |x Economic disciplines  |x Labor economics  |x Employment  |x Occupations  |x Artists  |x Musicians  |x Bards 
650 4 |a Economics  |x Microeconomics  |x Economic utility  |x Expected utility 
650 4 |a Economics  |x Microeconomics  |x Economic utility  |x Utility functions 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Cognitive processes  |x Problem solving  |x Heuristics 
650 4 |a Applied sciences  |x Computer science  |x Computer programming  |x Subroutines 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Descriptive statistics  |x Statistical distributions  |x Distribution functions  |x Probability distributions  |x Cumulative distribution functions 
650 4 |a Philosophy  |x Metaphysics  |x Etiology  |x Determinism 
650 4 |a Education  |x Educational resources  |x Instructional materials  |x Problem sets 
655 4 |a research-article 
700 1 |a Bennett, James E.  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Management Science  |d Institute for Operations Research and the Management Sciences, 1954  |g 37(1991), 2, Seite 198-215  |w (DE-627)320623602  |w (DE-600)2023019-9  |x 15265501  |7 nnns 
773 1 8 |g volume:37  |g year:1991  |g number:2  |g pages:198-215 
856 4 0 |u https://www.jstor.org/stable/2632391  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_JST 
912 |a GBV_ILN_11 
912 |a GBV_ILN_20 
912 |a GBV_ILN_22 
912 |a GBV_ILN_23 
912 |a GBV_ILN_24 
912 |a GBV_ILN_31 
912 |a GBV_ILN_32 
912 |a GBV_ILN_39 
912 |a GBV_ILN_40 
912 |a GBV_ILN_60 
912 |a GBV_ILN_62 
912 |a GBV_ILN_63 
912 |a GBV_ILN_65 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_95 
912 |a GBV_ILN_100 
912 |a GBV_ILN_110 
912 |a GBV_ILN_120 
912 |a GBV_ILN_152 
912 |a GBV_ILN_187 
912 |a GBV_ILN_224 
912 |a GBV_ILN_285 
912 |a GBV_ILN_374 
912 |a GBV_ILN_702 
912 |a GBV_ILN_2001 
912 |a GBV_ILN_2003 
912 |a GBV_ILN_2005 
912 |a GBV_ILN_2006 
912 |a GBV_ILN_2007 
912 |a GBV_ILN_2008 
912 |a GBV_ILN_2009 
912 |a GBV_ILN_2010 
912 |a GBV_ILN_2011 
912 |a GBV_ILN_2014 
912 |a GBV_ILN_2015 
912 |a GBV_ILN_2018 
912 |a GBV_ILN_2020 
912 |a GBV_ILN_2021 
912 |a GBV_ILN_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2034 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2048 
912 |a GBV_ILN_2050 
912 |a GBV_ILN_2055 
912 |a GBV_ILN_2056 
912 |a GBV_ILN_2057 
912 |a GBV_ILN_2059 
912 |a GBV_ILN_2061 
912 |a GBV_ILN_2065 
912 |a GBV_ILN_2068 
912 |a GBV_ILN_2106 
912 |a GBV_ILN_2107 
912 |a GBV_ILN_2108 
912 |a GBV_ILN_2111 
912 |a GBV_ILN_2112 
912 |a GBV_ILN_2113 
912 |a GBV_ILN_2118 
912 |a GBV_ILN_2122 
912 |a GBV_ILN_2129 
912 |a GBV_ILN_2143 
912 |a GBV_ILN_2147 
912 |a GBV_ILN_2148 
912 |a GBV_ILN_2152 
912 |a GBV_ILN_2153 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2232 
912 |a GBV_ILN_2472 
912 |a GBV_ILN_2935 
912 |a GBV_ILN_2940 
912 |a GBV_ILN_2949 
912 |a GBV_ILN_2950 
912 |a GBV_ILN_4012 
912 |a GBV_ILN_4035 
912 |a GBV_ILN_4037 
912 |a GBV_ILN_4046 
912 |a GBV_ILN_4112 
912 |a GBV_ILN_4125 
912 |a GBV_ILN_4126 
912 |a GBV_ILN_4242 
912 |a GBV_ILN_4246 
912 |a GBV_ILN_4249 
912 |a GBV_ILN_4251 
912 |a GBV_ILN_4305 
912 |a GBV_ILN_4306 
912 |a GBV_ILN_4307 
912 |a GBV_ILN_4313 
912 |a GBV_ILN_4322 
912 |a GBV_ILN_4323 
912 |a GBV_ILN_4324 
912 |a GBV_ILN_4325 
912 |a GBV_ILN_4326 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4338 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 37  |j 1991  |e 2  |h 198-215