求解约束优化问题的分组比较遗传算法

A Genetic Algorithm with Grouped Comparison for Optimization Problems with Constraints

Deb提出的基于遗传算法求解约束优化问题的约束处理方法简单易用,但存在一些不足之处.通过考虑不可行解在优化过程中的作用,对Deb的方法进行了改进,提出了分组比较的约束处理方法,并将该法结合到一个改进的遗传算法中.数值实验和比较结果表明了这种方法的有效性.

Deb's constraint handling method for genetic algorithms is of simplicity and easy to handle, but it has some drawbacks. In this paper, Deb's method is improved by considering the positive role of the infeasible solutions in the processes of optimization. A new constraint handling method called grouped comparison is proposed and it is successfully combined with an improved genetic algorithm. Numerical experiments and comparisons have proved the effectiveness of the proposed method.