| 改进的基于元胞自动机扩展模型的图的最短路径算法 |
| |
| 引用本文： | 李憨,薛惠锋,吴晓军. 改进的基于元胞自动机扩展模型的图的最短路径算法[J]. 微计算机应用, 2006, 27(3): 365-367 |
| |
| 作者姓名： | 李憨 薛惠锋 吴晓军 |
| |
| 作者单位： | 西北工业大学自动化学院,西安,710072 |
| |
| 摘 要： | 在基于元胞自动机单源点到单节点图的最短路算法的基础之上,通过改进控制演化的终止条件和记录演化过程中的路径信息,提出了单源点到多节点的元胞自动机扩展模型求解图的最短路算法模型，将该算法应用于城市道路交通网的实证研究之中,可以得到路段上任意两端点之间的最短路径及路权。
|
| 关 键 词： | 元胞自动机 最短路径算法 复杂性 城市道路 |
| 收稿时间： | 2005-09-26 |
| 修稿时间： | 2005-09-26 |
The Shortest Path Search Based on Improved Cellular Automata Extend Model |
| |
| LI Min,XUE Huifeng,WU Xiaojun. The Shortest Path Search Based on Improved Cellular Automata Extend Model[J]. Microcomputer Applications, 2006, 27(3): 365-367 |
| |
| Authors: | LI Min XUE Huifeng WU Xiaojun |
| |
| Abstract: | This paper constructs a new search algorithm to solve the shortest path problem. This algorithm is based on cellular automata extended model which search the shortest path from one node to another node. By improved on the terminate condition and record the evolutive information, an improved CA extended model to search the shortest path from one node to all other nodes is gained. The algorithm is proved by apply to the research of city traffic, the shortest path between any nodes can be quickly derived. |
| |
| Keywords: | Cellular automata Shortest path algorithm Complexity City road |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
