A society of hill-climbers
A society of hill-climbers
复制标题
登山者协会
DOI：
10.1109/icec.1997.592329
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
Marc Schoenauer
中科院分区：
文献类型：
--
作者：
M. Sebag;Marc Schoenauer
本文研究二分搜索空间中的函数优化问题。它的重点是登山者如何合作和/或利用他们过去的试验来加快搜索速度。登山者被视为一组突变。挑战是双重的：人们必须确定应该突变多少位，以及哪些位应该最好突变，或者换句话说，哪些攀登方向是首选的。后一个问题是通过记录登山者在个人体内最后一次最糟糕的考验来解决的，这一点被称为epoussoir。登山者们进一步探索他们现在所在地点的附近，以便远离泥土。对于前一个问题，没有提出明确的答案。然而，我们的实验表明，登山者的行为完全不同，这取决于一个人是设置了每个比特的突变率p/subm/，还是设置了每个人突变的确切比特数M。描述了两种描述登山者社会的算法，无论有没有过去的试验记忆。这些方法在几个900位的问题上进行了实验，并显著优于标准遗传算法和进化策略。
The paper is concerned with function optimisation in binary search spaces. It focuses on how hill climbers can work together and/or use their past trials in order to speed up the search. A hill climber is viewed as a set of mutations. The challenge is twofold: one must determine how many bits should be mutated, and which bits should preferably be mutated, or in other words, which climbing directions are to be preferred. The latter question is addressed by recording the last worst trials of the hill climbers within an individual, called repoussoir. The hill climbers further explore the neighborhood of their current point so as to get away from the repoussoir. As to the former question, no definite answer is proposed. Nevertheless, we experimentally show that hill climbers behave quite differently depending on whether one sets a mutation rate p/sub m/ per bit, or sets the exact number M of bits to mutate per individual. Two algorithms describing societies of hill climbers, with or without memory of the past trials, are described. These are experimented on several 900-bit problems, and significantly outperform standard genetic algorithms and evolution strategies.