大型交通网络最优路径的随机深度搜索算法

Random Depth-first Search Algorithm used in optimal path problem of large transport network

提出了随机子空间的概念,并应用于随机深度搜索算法。该算法可以解决大型交通网络最优路径的搜索问题。并运用于约4000个车站,520多条线路的交通网络并取得了成效。随机深度搜索算法可以2000ms快速的找到一个优秀解。

Wused random depth-first search algorithm to solve optimal path problem of large-scale transport network. We applied the algorithm to the transport network with more than 4,000 stations and 520 lines ,which have achieved success. Random depth-first search algorithm can find an excellent solution in 2000ms.