【24h】

Study Diploid System by a Hamiltonian Cycle Problem Algorithm

机译:用哈密顿循环问题算法研究二倍体系统

获取原文
获取原文并翻译 | 示例

摘要

Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of introducing more sophisticated operator, a diploid system was designed to divide the task into two steps: in meiosis phase, crossover was used to break two haploid of same individual into small units and remix them thoroughly. Then better phenotype was rebuilt from diploid of zygote in development phase. We introduced a new representation for Hamiltonian Cycle Problem and implemented an algorithm to test the system.
机译:遗传算法中的复杂表示和实际问题中的模式限制了交叉的影响,从而无法从零星的构建模块中构建更好的模式。没有引入更复杂的运算符,而是设计了二倍体系统将任务分为两个步骤:在减数分裂阶段,使用交叉将同一个人的两个单倍体分解为较小的单元,并将其彻底混合。然后在发育期从合子的二倍体重建更好的表型。我们为哈密顿循环问题引入了新的表示形式,并实现了一种算法来测试系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号