首页 | 本学科首页   官方微博 | 高级检索  
     检索      

遗传算法求解可行域分离的结构优化问题
引用本文:唐文艳,顾元宪,李云鹏,蔡雷.遗传算法求解可行域分离的结构优化问题[J].力学学报,2003,35(3):361-366.
作者姓名:唐文艳  顾元宪  李云鹏  蔡雷
作者单位:1. 大连理工大学工业装备结构分析国家重点实验室、工程力学系,大连,116024
2. 深圳市思乐数据技术有限公司,深圳,518054
基金项目:国家重点基础研究专项经费资助项目(G1999032805),国家高技术研究发展计划专项经费资助项目,高等学校骨干教师资助项目
摘    要:应用遗传算法求解了两类可行域分离的结构优化问题:局部屈曲约束的桁架拓扑优化问题和动力响应约束优化问题.对第一类问题,提出了新的数学表达式,适合于遗传算法求解.采用了改进的适应度函数及约束处理方法、约束凝聚选择、交叉操作改进和竞争最优保留,提高了遗传算法的效率和可靠性.算例说明,该方法能够克服可行域分离给传统优化算法带来的困难,有效地在多连通可行域中搜索全局最优解.

关 键 词:遗传算法  可行域分离  结构优化  约束凝聚选择  约束处理
修稿时间:2002年4月8日

GENETIC ALGORITHM APPLIED TO STRUCTURAL OPTIMIZATION PROBLEMS WITH DISJOINTED FEASIBLE DOMAINS
Tang Wenyan Gu Yuanxian Li Yunpeng.GENETIC ALGORITHM APPLIED TO STRUCTURAL OPTIMIZATION PROBLEMS WITH DISJOINTED FEASIBLE DOMAINS[J].chinese journal of theoretical and applied mechanics,2003,35(3):361-366.
Authors:Tang Wenyan Gu Yuanxian Li Yunpeng
Abstract:Genetic algorithm (GA) is applied to solve two kinds of structural optimization problems with disjointed feasible domains, which include problems of topology optimization for truss structures subject to stress and local buckling constraints and problems with dynamic response constraints. A new mathematic formula is proposed to the first kind of problems to make it fit the solution of GA. Some improvements on GA are proposed, such as improvement on fitness function and constraints handling, surrogate reproduction, improvement on crossover operator and competitive elitist model. This way, the efficiency and reliability of GA are improved. The numerical examples given in the paper show that GA can overcome difficulties result from disjointed feasible domains to the traditional optimization algorithms, and effectively search the global optimum from multi-connected feasible domains.
Keywords:design optimization  disjointed feasible domains  genetic algorithm  surrogate reproduction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号