| 变权值加快收敛的路径寻优实时算法 |
| |
| 引用本文： | 谭德荣, 严新平. 变权值加快收敛的路径寻优实时算法[J]. 交通运输工程学报, 2004, 4(1): 118-120. |
| |
| 作者姓名： | 谭德荣 严新平 |
| |
| 作者单位： | 山东理工大学,交通学院,山东,淄博,255012;武汉理工大学,ITS研究中心,湖北,武汉,430063 |
| |
| 基金项目： | 教育部博士点基金项目(20010497002) |
| |
| 摘 要： | 为获得满意解为目标的最优路径选择问题, 给出了一种加权的LRTA* (LearningReal Time A*) 算法, 通过改变估价函数值更新规则与解时间和解质量的相对折中, 加快算法收敛速度。实例应用表明, 该方法比LRTA*算法更快地收敛于满意解, 是一种求解大城市稠密路网两点间最优路径的有效方法。
|
| 关 键 词： | 智能交通 最优路径 启发式搜索算法 人工智能 值更新规则 |
| 文章编号： | 1671-1637(2004)01-0118-03 |
| 收稿时间： | 2003-04-15 |
| 修稿时间： | 2003-04-15 |
Real-time algorithm of finding optimal path with changing weight to speed up convergence |
| |
| TAN De-rong, YAN Xin-ping. Real-time algorithm of finding optimal path with changing weight to speed up convergence[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 118-120. |
| |
| Authors: | TAN De-rong YAN Xin-ping |
| |
| Affiliation: | 1. School of Transportation, Shandong University of Technology, Zibo 255012, China;;2. ITS Center, Wuhan University of Technology, Wuhan 430063, China |
| |
| Abstract: | For obtaining a satisfactory shortest path, this paper proposed an improved LRTA~* to speed up search algorithm convergence through changing value-update rules. Through the trade-off of time and quality of solution, the convergence speed was fasted. Application result shows that the method converges suboptimal solution faster than LRTA~*, it is a better algorithm to solve the satisfactory solution between O-D for a big density route network. 1 tab, 1 fig, 8 refs. |
| |
| Keywords: | intelligent transport optimal path heuristic search algorithm artificial intelligence value-update rules |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《交通运输工程学报》浏览原始摘要信息 |
|
点击此处可从《交通运输工程学报》下载全文 |
|
