摘要
A new algorithm named self adapting genetic algorithm is presented to avoid the bugs such as the premature problem and the low convergence speed of the standard genetic algorithm. The self adapting mutation operator automatically adjusts the step size of variable so that the convergence speed is improved. Crossover probability and location are calculated by units applicability which enhanced the intelligence of the algorithm. Two special units U0 and U1 ensure the integrality of gene. Duo to the complexity of blade surface of water turbine, the reference mark and coordinate are difficult to establish on the blade roughcast. According to this, the coordinates of the measured data and design surface need transforming to achieve the optimal matching. The self adapting genetic algorithm is applied to solve the optimal matching question and the results suggest that this algorithm has higher operation speed and stability compared with the standard genetic algorithm.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 101-104 |
| 页数 | 4 |
| 期刊 | Zhuzao Jishu/Foundry Technology |
| 卷 | 27 |
| 期 | 2 |
| 出版状态 | 已出版 - 2月 2006 |
学术指纹
探究 'New approach for blade roughcast optimal matching based on self adapting genetic algorithm' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver