首页> 外国专利> GLOBAL OPTIMIZATION, SEARCH AND MACHINE LEARNING METHOD BASED ON THE LAMARCKIAN PRINCIPLE OF INHERITANCE OF ACQUIRED CHARACTERISTICS

GLOBAL OPTIMIZATION, SEARCH AND MACHINE LEARNING METHOD BASED ON THE LAMARCKIAN PRINCIPLE OF INHERITANCE OF ACQUIRED CHARACTERISTICS

机译:基于获得性特征遗传的拉马克原理的全局优化,搜索和机器学习方法

摘要

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 ƒ(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 G0={P01, P02, . . . , P0S}, 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 Gk={Pk1, Pk2, . . . , PkS} iteratively using a Lamarckian “Heredity Operator” and a “Use-and-Disuse Operator” based on the values of ƒ(Gk); and step 4: outputting the final set of optimal solutions to the problem.
机译:本发明公开了一种基于拉马克遗传继承特征的全局优化,搜索和机器学习的方法,包括步骤1:根据要解决的问题构造目标函数ƒ(P),其中P表示候选解集解决问题步骤2:将P编码到遗传算法(GA)染色体中,输入或自动计算GA的算法参数,并初始化算法和候选解生成量G 0 = {P 0 1 ,P 0 2 ,。 。 。 ,P 0 S },其中S是总体G的大小,0代表初始代;步骤3:在第k代,优化候选解决方案的主要种群G k = {P k 1 ,P k < / Sub> 2 ,。 。 。 ,P k S }根据ƒ(G k <的值,使用Lamarckian的“遗传运算符”和“使用和废弃运算符”进行迭代/ Sub>);步骤4:输出针对该问题的最终最优解集。

著录项

  • 公开/公告号US2018260714A1

    专利类型

  • 公开/公告日2018-09-13

    原文格式PDF

  • 申请/专利权人 YUN LI;LIN LI;DONGGUAN UNIVERSITY OF TECHNOLOGY;

    申请/专利号US201815917142

  • 发明设计人 YUN LI;LIN LI;

    申请日2018-03-09

  • 分类号G06N3/12;G06F19/28;G06F19/24;G06F17/17;

  • 国家 US

  • 入库时间 2022-08-21 13:02:05

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号