基于精英策略的反序-杂交算法

Inver-over Algorithms Based on Elite-policy

论述了反序-杂交算子在求解TSP上的优势,认为该算子算法结构简单,在求解问题时不仅速度快,而且有很好的精确性和稳定性。基于多父体杂交算法的精英子空间的方法在求解函数优化问题上可以得到很好的结果,将精英策略和反序-杂交算子相结合,来求解组合优化问题,在反序-杂交算法中运用精英策略进行个体选择,使算法具有更强的学习能力。数值实验表明,新算法比传统的反序-杂交算子具有更快的运行速度和更好的求解精度。

TSP （Traveling Salesman Problem） is one of the typical NP- hard problems in combinational optimization. The advantages of Inver - over algorithm in solving TSP problems were discussed. With simple structure, this algorithm has a faster running speed and better accuracy and stability. Based on the Inver-over algorithm, the evolutionary algorithm is effective for solving combinational optimization problem, which owes much to the effective use of elite-policy. Combined with Inver-over algorithm, the elite policy can be used to solve the combinational optimization problem. Using the elite-policy to make individual selection in the Inver-over algorithm will make the algorithm full of learning ability. Numerical experiments show that the running-speed of the new algorithm is faster and more accurate than the old one.