• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Soft computing: A fusion of foundations, methodologies and applications >A novel selection mechanism for evolutionary algorithms with metameric variable-length representations
【24h】

A novel selection mechanism for evolutionary algorithms with metameric variable-length representations

机译：具有Metameric变量长度表示的进化算法的新颖选择机制

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Metameric problems are variable-length optimization problems whose representations take on an at least partially segmented structure. This is referred to as a metameric representation. Frequently, each of these segments defines one of a number of analogous components in the solution. Examples include the nodes in a coverage network or turbines in a wind farm. Locating optimal solutions requires, in part, determining the optimal number of components. Evolutionary algorithms can be applied but require modifications to the traditional fixed-length operators. This study proposes a new selection operator for metameric problems: length niching selection. First, the population is partitioned into several niches based on solution length. A window function determines at which lengths a niche is formed. Local selection is then applied within each niche independently, resulting in a new parent population formed by a diverse set of solution lengths. A coverage and a wind farm problem are used to demonstrate the effectiveness of the new operator.
机译：Metameric问题是可变长度优化问题，其表示占据至少部分分段结构。这被称为质量表示。通常，每个段中的每一个定义解决方案中多种类似组件中的一个。示例包括在风电场中的覆盖网络或涡轮机中的节点。定位最佳解决方案部分需要确定最佳组件数。可以应用进化算法，但需要修改传统的固定长度运算符。本研究提出了一种新选择运营商，用于Metameric问题：长度占状选择。首先，基于溶液长度将人口分成几个核心。窗口功能确定形成长度的长度。然后独立地应用局部选择，导致通过各种溶液长度形成的新父母群。覆盖范围和风力源问题用于展示新运营商的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号