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

Table 2

The result from the improved AO^∗ algorithm search.

Number of nodes in an optimal path	Number of solution graph nodes	Number of generated graph nodes	Number of iterations from the starting node	Time for search (s)
6	7	11	5	0.2
7	8	14	7	0.3
8	8	15	7	0.3
9	9	13	8	0.3
10	10	18	9	0.4
11	11	18	10	0.4
12	12	19	11	0.4
13	15	19	12	0.4
14	14	20	12	0.4
15	17	24	14	0.5
16	16	25	15	0.5