节点文献
一种基于新约束处理方法的遗传算法
Genetic algorithm based on novel constraints addressing method
【摘要】 针对目前的约束处理方法中存在的问题,提出一种新的约束处理方法。该方法通过可行解和不可行解混合交叉的方法对问题的解空间进行搜索,对可行种群和不可行种群分别进行选择操作。避免了惩罚策略中选取惩罚因子的困难,使得约束处理问题简单化。实例测试结果表明,该约束处理方法的有效性。
【Abstract】 A new method to handle constrained optimization is proposed in this paper,to overcome certain disadvantages of the current methods.This method searches the solution space of the problem through the admixture crossover of feasible and infeasible solutions,and performs the selection operation on feasible and infeasible populations respectively.It avoids the difficulty of selecting the penalty factor in penalty strategy and makes the handling constraint simplify.Numerical results show that it is an effective method.
【关键词】 遗传算法;
约束处理;
可行解;
不可行解;
【Key words】 genetic algorithm; constraint handling; feasible solution; infeasible solution;
【Key words】 genetic algorithm; constraint handling; feasible solution; infeasible solution;
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2007年14期
- 【分类号】TP18
- 【被引频次】27
- 【下载频次】478