检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《现代制造工程》2011年第1期13-16,共4页Modern Manufacturing Engineering
基 金:国家自然科学基金项目(51075144);湖南省十一五重点建设学科(机械设计及理论)项目(湘教通2006180);湖南省科技计划项目(2009GK3158)
摘 要:将生物系统中"入侵"的概念引入遗传算法,提出机构综合排斥二周期点优化求解的一种基于混沌搜索自适应入侵遗传算法。该算法动态地引入入侵种群,并利用混沌搜索产生入侵个体。入侵种群的扩散使优良基因得以在个体中传播,优化了种群的基因构成,能够促使种群跳出局部最小,并向全局优化方向进化,从而有效避免了遗传算法的早熟现象。将该算法应用排斥二周期点优化求解,实例表明该算法具有较快的收敛速度和较强的寻优能力,能够快速求出机构综合问题非线性方程组全部解。By introducing the concept of invasion of biological systems into Genetic Algorithm(GA) ,a chaos search for the optimum solution of repulsion two-cycle point of mechanism synthesis based Adaptive Invading Genetic Algorithm (AIGA) was proposed. The invading population, whose size was dynamically determined, was obtained through Chaos Search (CS). The expansion of the invading population was capable of propagating excellent genes among individuals and optimizing the gene structure of the population. And thus, it made the population evolve towards the global optimum. As a result, the algorithm was able to diminish the probability of being convergent to local minima prematurely. The proposed algorithm was applied to the repulsion two-cycle point function optimization. And the mechanism synthesis results show that this algorithm has the merits of fast convergence and global optimization and can find all solutions of the nonlinear equations for mechanism synthesis nonlinear questions.
关 键 词:混沌搜索 遗传算法 入侵率 非线性方程组 排斥二周期点 机构综合
分 类 号:TH112[机械工程—机械设计及理论] TH133.502
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222