基于二叉树的启发式搜索算法改进

最短路径是现代物流配送研究中热点问题之一,在分析传统启发式搜索算法的基础上,针对算法在路径优化中存在的不足,提出基于二叉树优化启发式搜索算法（A＊）实现所需结点之间最短路径查询,在引入已知的全局信息条件下选择下一个被检查的结点,并根据用户给出的起始顶点与目标顶点以及搜索的角度查找最短路径,从而搜索可能性较大的结点,提高搜索过程的效率.实验表明,基于二叉树的A＊比A＊效率提高11％～26％.

Improved the Heuristic Search Algorithm based B-tree

the shortest path is one ot the not issues of the modern logistic, aanalyzing tradition A algorithm, achieve the shortest path between nodes based on the duringselecting the next check node, introduce the global information, And estimate of the current and the endnode, It ,searches the shortest path within the sector limit because searching area and searching directionare limited, to improve the efficiency of the search process, Experimental verification the improved A algorithm improve efficiency by 11%-26% than A.