关键词: 标准遗传算法 局部搜索 &epsilon, -混合遗传算法 局部搜索半径

Abstract:

The extensive ability of SGA surpasses its refinement ability. It is difficult to control the precision when we solve the GA-hard problems. This paper proposes a new hybrid genetic algorithm,ε-HGAA. After finding the most optimal individual in each generation, it takes this optimal individual as th initial point to carry out local search in a fixed-radius region. The search results replace the worst individual or other individuals; and the algorithm enters the next generation operation again. This algorithm not only increases the solution precision, but also enhances the stability.

Key words: SGA, local seareh, ε-HGAA, radius of local search