提出了两种新的约减算法 ,分别运用遗传算法和 Best-First搜索方法求约减集 .前者利用了遗传算法的寻优特性从种群中获得一个最优及一组次优个体 ,进而获得一组约减 ;后者采用Best-First搜索方法 ,相对于 A算法可扩大搜索空间 ,并可从 open表前部获得一最优及一组次优的状态节点 ,进而获得一组约减 .实验结果表明 ,文中提出的算法是有效且合理的 Two new reduction algorithms are proposed, which are based on the genetic algorithm and the Best-First search method, respectively. The former obtains an optimal and a group of suboptimal individuals from the population by using the superiority of the genetic algorithm, A set of reduction; the latter using Best-First search method, compared to the A algorithm can expand the search space, and from the front of the open table to obtain an optimal and a group of suboptimal state nodes, and then get a set of reduction. Experimental results show that the proposed algorithm is effective and reasonable