检索结果-内蒙古大学图书馆

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

SOFT COMPUTING 2020年第21期24卷 16439-16452页

作者： Ryerkerk, Matt Averill, Ron Deb, Kalyanmoy Goodman, Erik Michigan State Univ E Lansing MI 48824 USA

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 representations Evolutionary algorithms variable-length algorithms

来源：评论

学校读者我要写书评

暂无评论

A survey of evolutionary algorithms using metameric representations

引用

GENETIC PROGRAMMING AND EVOLVABLE MACHINES 2019年第4期20卷 441-478页

作者： Ryerkerk, Matt Averill, Ron Deb, Kalyanmoy Goodman, Erik Michigan State Univ E Lansing MI 48824 USA

Evolutionary algorithms have been used to solve a number of variable-length problems, many of which share a common representation. A set of design variables is repeatedly defined, giving the genome a segmented structure. Each segment encodes a portion, frequently a single component, of the solution. For example, in a wind farm design problem each segment may encode the position and height of a single turbine. This is described as a metameric representation, with each segment referred to as a metavariable. The number of metavariables can vary among solutions, requiring modifications to the traditional fixed-length evolutionary operators. This paper surveys the literature that uses metameric representations with a focus on the problems being solved, the specifics of the representation, and the modifications to evolutionary operators. While there is little cross-referencing among the cited articles, it is demonstrated that there is already a strong overlap in their methodologies. By considering problems using a metameric representation as a single class, greater recognition of commonalities and differences among these works can be achieved. This could allow for the development of more efficient metameric evolutionary algorithms.

关键词： Evolutionary algorithms variable-length algorithms Metameric representations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：