Improved AND/OR Tree Search Algorithm in Analysis of Stochastic and Time-Dependent Shortest Path Problem

<div>The comparison of the efficiency of the original and improved AO<sup>∗</sup> algorithm. (a) Comparison of the generated graph nodes. (b) Comparison of iteration from the starting node. (c) Comparison of running time. (d) Comparison of solution graph nodes.</div>

Scientific Programming

fig10

Figure 10

Figure 10: Improved AND/OR Tree Search Algorithm in Analysis of Stochastic and Time-Dependent Shortest Path Problem 