基于改进燃烧算法的最优路径规划  

Enhanced burning algorithm for optimal path planning

作　　者：邹永贵[1] 梁新发[1] 徐海波[1] 

机构地区：[1]重庆邮电大学空间信息系统研究所,重庆400065

出　　处：《计算机应用研究》2009年第11期4094-4097,共4页Application Research of Computers

摘　　要：针对燃烧算法在公交查询系统中求解最优路径问题的不足,以及为了更好地服务于乘客,对燃烧算法中的存储结构进行改进和优化,采用新的搜索思想并设置算法终止判断条件,提出了基于公交站点的双向燃烧搜索算法。仿真结果表明,该算法在时间、空间代价以及准确性方面均具有显著的优越性。This paper described the insufficiency of the burning algorithm in solving optimal path in public transportation sys tem, and to better serve passengers. Through improving its storage structure and optimization, combining with a new search strategy and setting the algorithm＇ s termination judgment conditions, proposed a new search algorithm based on the public transportation station＇ s bidirectional burning algorithm. The simulation result proves that the proposed algorithm in the time price, the spatial price as well as the accuracy has the remarkable superiority than the original burning algorithm.

关 键 词：燃烧算法 最优路径 路径规划 最短路径 双向搜索算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]