best first parser

Investigation into yard crane scheduling using BFS algorithm;

一种基于最佳优先搜索算法的集装箱堆场场桥调度策略

As the traditional real-time scheduling algorithms are no longer suitable for characteristics of NC system,a heuristic best-first search(BFS) algorithm was introduced to schedule HTS model tasks.

针对数控系统中多种类型任务并存,且任务之间在时序、资源等方面存在相关性的特点,建立了混合任务系统模型,并引入计算机人工智能领域的启发式最佳优先搜索算法来实现该模型任务集的最优调度。

As feasible solution sets of this problem can be organized as a tree structure,we use Best-First search strategy(BF) to traverse the tree,for which we propose an effective heuristic rule called k steps exploration.

最后用最佳优先搜索算法(BF)对一组公认的算例进行了实算,计算结果表明,BF计算效率优于传统的遗传算法和Monte Carlo方法。