Glover提出了一种解决路径规划问题的混合算法，此种算法具有标签设定

Glover提出了一种解决路径规划问题的混合算法，此种算法具有标签设定和标签纠正算法的特征，实验证明具有超越两种算法的特性，叫做THRESH[7]。Hart.etal等人提出了A*算法，A*算法是一种启发式搜索算法是利用找到和问题相关的启发因子来加快搜索过程，从而缩减搜索图的时间[8]。罗国青运用了蚁群算法实现了动态最优路径搜索，并比较了蚁群算法与Dijkstra算法的仿真结果，作者对动态时间的计算采用美国公路局推出的BPR函数模型，道路交通流量则取某一天小时交通流量[9]。

結果 (英文) 1:

Glover proposes a way to solve the problem of path planning algorithm, this algorithm has a tag set and label correcting algorithm of feature, proved to have the better characteristics of two kinds of algorithms, known as THRESH[7]. Hart.etal, who presented the a * algorithm, the a * algorithm is a heuristic search algorithm is used to find and question the inspiration factor related to speed up the search process, resulting in reduced search time [8]. Luo Guoqing using Ant Colony optimization algorithm for dynamic optimal route search and compare simulation results of the Ant Colony algorithm and Dijkstra algorithm, the author of the dynamic time calculations using United States Highway Authority launched the BPR function model, road traffic is taking a one-hour traffic [9].

結果 (英文) 2:

Glover proposes a hybrid path planning algorithm to solve the problem, this algorithm has a label setting and label correcting algorithms feature has proved beyond the characteristics of the two algorithms, called THRESH [7]. Hart.etal et al proposed A * algorithm, A * algorithm is a heuristic search algorithm is to find and issues related to the use of heuristic factor to speed up the search process, thereby reducing the search time graph [8]. Luo Guoqing use of the ant colony algorithm to achieve a dynamic optimal path search and compare the ant colony algorithm Dijkstra algorithm with the simulation results, the authors calculate the dynamic time using BPR function model introduced American Highway, the road traffic then take one day hour traffic [9].

結果 (英文) 3:

Glover proposes a hybrid algorithm to solve the problem of path planning, this algorithm has the characteristics of label setting and label correcting algorithm, experiments prove that it has the characteristics of more than two kinds of algorithm, called THRESH[7]. Hart.etal et al proposed A* algorithm, A* algorithm is a heuristic search algorithm is a heuristic factor using find and problems related to speed up the search process, thus reducing the search graph in time [8]. Luo Qingyun using ant colony algorithm to achieve the optimal dynamic path search, and compare the simulation results of ant colony algorithm and Dijkstra algorithm, dynamic calculation of the time using BPR function model introduced America highway bureau,Traffic flow is a certain day hour traffic flow [9].