摘要
A evolutionary approach to solve the multiobjective optimization problems, mixed strategies Pareto evolutionary programming (MSPEP), is presented. Based on the performance of mutation strategies, the mixed strategy distribution is dynamically adjusted. By combining the Pareto strength ranking procedure with the mixed mutation strategies, a new evolutionary algorithm is proposed. The proposed approach is compared with other evolutionary optimization techniques in several benchmark functions. Experimental results demonstrate that the proposed method could rapidly converge to the Pareto optimal front and spread widely along the front.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 794-800 |
| 页数 | 7 |
| 期刊 | Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence |
| 卷 | 19 |
| 期 | 6 |
| 出版状态 | 已出版 - 12月 2006 |
| 已对外发布 | 是 |
学术指纹
探究 'Mixed strategies Pareto evolutionary programming' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver