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.

中文翻译：

---

使用元数据表示的进化算法调查

进化算法已被用于解决许多变长问题，其中许多具有共同的表示。一组设计变量被重复定义，给基因组一个分段结构。每个段编码解决方案的一部分，通常是单个组件。例如，在风电场设计问题中，每个段都可以编码单个涡轮机的位置和高度。这被描述为同色异谱表示，每个段称为元变量。元变量的数量可能因解决方案而异，需要对传统的固定长度进化算子进行修改。本文调查了使用同色异谱表示的文献，重点关注正在解决的问题、表示的细节以及对进化算子的修改。虽然引用的文章之间几乎没有交叉引用，但事实证明，它们的方法已经存在很大的重叠。通过将同色异谱表示作为单一类别来考虑问题，可以更好地识别这些作品之间的共性和差异。这可以允许开发更有效的同色异谱进化算法。