| 基于布尔可满足性的动态路径优化算法 |
| |
| 引用本文： | 曹立志.基于布尔可满足性的动态路径优化算法[J].交通科技与经济,2011,13(2):26-28. |
| |
| 作者姓名： | 曹立志 |
| |
| 作者单位： | 长沙理工大学交通运输工程学院,湖南长沙,410004 |
| |
| 摘 要： | 在对现有的经典路径优化算法性能进行分析基础上,指出现有算法的缺点。通过对布尔可满足性理论的研究,提出基于布尔可满足性的路径优化算法,并结合记忆机制,将其应用在动态路径优化中,减少最短路径的搜索时间和不必要的重复搜索,体现该算法的优势。最后,利用该算法对一简单路网进行验证。
|
| 关 键 词： | 布尔可满足性 记忆机制 动态路径优化 Dijkstra算法 A*算法 |
Research on Dynamic Path Optimization Algorithm Based on Boolean Satisfiability |
| |
| CAO Li-zhi.Research on Dynamic Path Optimization Algorithm Based on Boolean Satisfiability[J].Technology & Economy in Areas of Communications,2011,13(2):26-28. |
| |
| Authors: | CAO Li-zhi |
| |
| Institution: | CAO Li-zhi(School of Traffic and Transportation Engineering,Changsha University of Science and Technology,Changsha 410004,China) |
| |
| Abstract: | Based on the analysis of the classical algorithms of traffic path optimization,the current algorithms appear insufficient.Through studying the theory of Boolean Satisfiability,a new path optimization algorithm based on Boolean Satisfiability and mnemonic mechanism was proposed.Applied to the dynamic path optimization,this new algorithm has reduced the searching time and the unnecessary search.In the end,the proposed algorithm was tested in a simple network. |
| |
| Keywords: | Boolean Satisfiabilty mnemonic mechanism dynamic path optimization Dijkstra algorithm A* algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
