Heuristics mutation operator and local search scheme are designed in the algorithm.
该算法采用新的启发式变异算子和局部搜索算子。
It adopts 2-interchange mutation operator in ant colony algorithm to increase its ability of local search and to improve the quality of the solution.
该算法通过在蚁群算法中引入遗传算法的2 -交换变异算子,增强了算法的局部搜索能力,提高了解的质量。
The algorithm includes selection, expansion and mutation operations, expansion is used for local search and mutation is used for global search in solution space.
算法包括选择、扩展和突变操作,扩展和突变操作分别在解空间中局部和全局范围内搜索最优解。
应用推荐