A Cooperative -Learning Path Planning Algorithm for Origin-Destination Pairs in Urban Road Networks

Table 6

The comparison results of different algorithms.

Algorithm	Multipath	Costs	Reliability	Time
Dijkstra’s algorithm	1-6-7-12-13-14-19-24-25	25	0.57	0.010142
-shortest path planning	1-6-7-12-13-14-19-24-25; 1-6-11-16-21-22-23-24-25; 1-2-7-12-13-14-19-24-15; 1-6-7-12-13-14-19-20-25	25; 26; 27; 27	0.77	0.104754
learning multipath path planning	1-6-11-16-21-22-23-24-25; 1-6-11-16-17-18-19-20-25; 1-2-7-12-13-18-19-20-25; 1-2-3-13-18-23-19-20-25	26; 31; 30; 29	0.95	0.110398