| 大型交通网络最优路径的随机深度搜索算法 |
| |
| 引用本文： | 张超,刘蕊洁.大型交通网络最优路径的随机深度搜索算法[J].铁路计算机应用,2009,18(2):55-56. |
| |
| 作者姓名： | 张超 刘蕊洁 |
| |
| 作者单位： | 太原铁路局,太原车务段,太原,030001%兰州交通大学,数理与软件工程学院,兰州,730070 |
| |
| 摘 要： | 提出了随机子空间的概念,并应用于随机深度搜索算法.该算法可以解决大型交通网络最优路径的搜索问题.并运用于约4000个车站,520多条线路的交通网络并取得了成效.随机深度搜索算法可以2 000ms快速的找到一个优秀解.
|
| 关 键 词： | 随机搜索 深度搜索 最短路 |
| 收稿时间： | 2009-02-15 |
Random Depth-first Search Algorithm used in optimal path problem of large transport network |
| |
| ZHANG Chao,LIU Rui-jie.Random Depth-first Search Algorithm used in optimal path problem of large transport network[J].Railway Computer Application,2009,18(2):55-56. |
| |
| Authors: | ZHANG Chao LIU Rui-jie |
| |
| Institution: | ZHANG Chao, LIU Rui-jie (1. Railway Train Operation Section of Taiyuan Railway Bureau, Taiyuan 030001, China; 2. School of Mathematics, physics ＆ software Engineering Lanzhou JiaoTong University, Lanzhou 730070, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | random search depth-first search optimal path |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《铁路计算机应用》浏览原始摘要信息 |
| 点击此处可从《铁路计算机应用》下载免费的PDF全文 |
|
