|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009年02 期
| 標(biāo)題 |
| 大型交通網(wǎng)絡(luò)最優(yōu)路徑的隨機(jī)深度搜索算法(18 卷) |
| 英文標(biāo)題 |
| Random Depth-first Search Algorithm used in optimal path problem of large transport network |
| 摘要 |
| 提出了隨機(jī)子空間的概念，并應(yīng)用于隨機(jī)深度搜索算法。該算法可以解決大型交通網(wǎng)絡(luò)最優(yōu)路徑的搜索問(wèn)題。并運(yùn)用于約4000個(gè)車站，520多條線路的交通網(wǎng)絡(luò)并取得了成效。隨機(jī)深度搜索算法可以2 000ms快速的找到一個(gè)優(yōu)秀解。 |
| 作者 |
| 新聞作者:張 超1，劉蕊潔2 |
| 關(guān)鍵字 |
