An improved constrained optimization genetic algorithm

摘要：

This paper analyzed the unreasonable of widespread use of competitive selection rules to solving Constrained Optimization Genetic Algorithm. With the concept of Pareto dominance and the sequence of individual factorial design a new sort of population model. It balances the feasible region and constraints optimal solution search direction, which makes the Constrained Optimization Genetic Algorithm along both sides of feasible region to search for constrained optimal solution. There is a relationship between feasible region in demes and evolutional generation and also the order factor.It considers both the algorithmic search quality and efficiency optimization. The numerical experiment and engineering example have shown, the improved Constrained Optimization Genetic Algorithm has the more simple algorithm structure, the higher solution quality and much more stable.

关键词： Constrained Optimizationt Pareto dominance Constrained Optimization Genetic Algorithm

作者: Fei,ye Yu, Haiyang Jiang, Xueshou

作者单位: School of Traffic & Mechanical Engineering Shenyang Jianzhu University Shenyang, China China Huadian Engineering Co,.Ltd Beijing, China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 435-439

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）