【摘要】 提出一种整数编码的改进遗传算法,它采用(—1,0,1)局部寻优算子,并提出寻优基点的选取策略,提出了重要约束罚项的概念来处理不同组合相同适应度的问题,以此来改善遗传算法后期收敛速度慢和不成熟收敛的问题。通过算例表明,这种算法对于离散变量的结构优化可以取得较快的收敛速度和较好的收敛结果。更多还原

【Abstract】 In this paper, an improved integer coded genetic algorithm is presented for discrete optimization of structures. It takes (-1,0,1) programming operator to expand the ability of local searching and presents a strategy to choose the starting point of (-1,0,1) programming operator. It also presents a restriction punish gene to discriminate the phenomenon of the same fitness for different combinations. The result of an example shows that this algorithm converges to the best solution quite quickly.更多还原