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

Table 1

The result of the 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	33	69	17	0.7
7	45	91	26	1.1
8	63	155	29	2
9	97	235	59	4.2
10	100	259	51	4.3
11	96	187	49	4.7
12	78	221	51	8.1
13	145	419	47	17.1
14	226	591	78	34.1
15	220	537	81	49.5
16	253	624	89	51