摘要
GA作为一种新的全局优化搜索技术比其他搜索算法,优点明显;其不足之处是当搜索具有复杂染色体结构的求解空间时收敛速度慢。针对这问题,提出了一种改进的相对快速收敛的GA算法的思路:增加对染色体的分割与重组操作,依据于各段的结构和段长,组成段群体(segmented population),对其实施遗传操作以寻找优化段,重新组合成完整的染色体来搜索优化解。
Genetic Algorithms（GA） is a calculation model to imitate living creature evolution. It has obvious weakness at speed approach the terminal point. In order to speed up the approach superior solution, based on experiences in works about GA,a new kind of proposal about it is summed up in this thesis：increasing the operations（dividing and recombination） of the chromosome and a few others handles properly,and take ＇eight empress problem＇ as an example proceeded the verification.
出处
《现代电子技术》
2007年第18期76-77,共2页
Modern Electronics Technique
基金
黑龙江省教育厅科学技术研究项目(10553127)
