Changing Representations During Search: A Comparative Study of Delta Coding
Changing Representations During Search: A Comparative Study of Delta Coding
复制标题
搜索过程中改变表示：Delta 编码的比较研究
DOI：
10.1162/evco.1994.2.3.249
复制
发表时间：
1994
影响因子：
6.8
通讯作者：
L. D. Whitley
中科院分区：
文献类型：
--
作者：
Keith E. Mathias;L. D. Whitley
Delta编码是一种迭代遗传搜索策略，它动态地改变搜索空间的表示，试图利用不同的问题表示。Delta编码通过在每次搜索迭代时重新初始化种群来维持搜索。这有助于避免在遗传搜索中通常观察到的渐近性能，因为群体变得更加均匀。在这里，增量编码的优化能力是经验比较CHC，ESGA，GENITOR，和随机突变爬山（RMHC）的一套众所周知的测试功能，有和没有格雷编码。格雷编码对这些测试功能的影响有关的问题得到解决。
Delta coding is an iterative genetic search strategy that dynamically changes the representation of the search space in an attempt to exploit different problem representations. Delta coding sustains search by reinitializing the population at each iteration of search. This helps to avoid the asymptotic performance typically observed in genetic search as the population becomes more homogeneous. Here, the optimization ability of delta coding is empirically compared against CHC, ESGA, GENITOR, and random mutation hill-climbing (RMHC) on a suite of well-known test functions with and without Gray coding. Issues concerning the effects of Gray coding on these test functions are addressed.