首页>
外国专利>
GLOBAL OPTIMIZATION, SEARCHING AND MACHINE LEARNING METHOD BASED ON LAMARCK ACQUIRED GENETIC PRINCIPLE
GLOBAL OPTIMIZATION, SEARCHING AND MACHINE LEARNING METHOD BASED ON LAMARCK ACQUIRED GENETIC PRINCIPLE
展开▼
机译:基于拉马克获得的遗传原理的全局优化,搜索和机器学习方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
The invention discloses a global optimization, search and machine learning method based on the Lamarckian principle of inheritance of acquired characteristics, comprising step 1: constructing an objective function f ( P ) according to the problem being solved, where P represents a set of candidate solutions to the problem; step 2: encoding P into a genetic algorithm (GA) chromosome, inputting or automatically calculating algorithmic parameters of the GA, and initializing the algorithm and the population of candidate solution generation G 0 ={ P 0 1 , P 0 2 , ..., P 0 S }, where S is the size of the population G and 0 stands for the initial generation; step 3:at generation k, optimizing the prevailing population of the candidate solutions G k ={ P k 1 , P k 2 , ..., P k S } iteratively using a Lamarckian "Heredity Operator" and a "Use-and-Disuse Operator" based on the values of f ( G k ); and step 4: outputting the final set of optimal solutions to the problem.
展开▼
机译:本发明公开了一种基于拉马克遗传继承特征的全局优化,搜索和机器学习的方法,包括步骤1:根据要解决的问题构造目标函数f(P),其中P表示候选解集解决问题步骤2:将P编码到遗传算法(GA)染色体中,输入或自动计算GA的算法参数,并初始化算法和候选解生成总体G 0 = {P 0 1,P 0 2,... ,P 0 S},其中S是总体G的大小,0代表初始代;步骤3:在生成k时,使用Lamarckian“ Heredity运算符”和“ Use-and-”反复优化候选解的主要种群G k = {P k 1,P k 2,...,P k S}基于f(G k)的值的“废弃运算符”;步骤4:输出针对该问题的最终最优解集。
展开▼