arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/9904056math.OC
收藏

Extremal Optimization:源自协同进化的方法

Extremal Optimization: Methods derived from Co-Evolution

Stefan Boettcher, Allon G. Percus

摘要:

我们描述了一种通用的方法,寻找高质量的解决方案,硬最优化问题,灵感来自自组织的关键模型的共同进化,如巴克Sneppen模型。这种方法被称为极值优化,它连续地消除了次最优解中极不需要的成分,而不是“培育”更好的成分。与遗传算法不同,遗传算法对可能解决方案的整个“基因池”进行操作,极值优化通过将其每个组成部分视为根据达尔文原则共同进化的物种来改进单个候选解决方案。与模拟退火不同,它的非平衡方法影响了需要很少参数调整的算法。只有一个可调参数,其性能证明竞争力,往往优于,更精细的随机最优化程序。我们在这里展示了两个经典的硬最优化问题:图划分和流动推销员问题。

英文摘要:

We describe a general-purpose method for finding high-quality solutions to hard optimization problems, inspired by self-organized critical models of co-evolution such as the Bak-Sneppen model. The method, called Extremal Optimization, successively eliminates extremely undesirable components of sub-optimal solutions, rather than ``breeding'' better components. In contrast to Genetic Algorithms which operate on an entire ``gene-pool'' of possible solutions, Extremal Optimization improves on a single candidate solution by treating each of its components as species co-evolving according to Darwinian principles. Unlike Simulated Annealing, its non-equilibrium approach effects an algorithm requiring few parameters to tune. With only one adjustable parameter, its performance proves competitive with, and often superior to, more elaborate stochastic optimization procedures. We demonstrate it here on two classic hard optimization problems: graph partitioning and the traveling salesman problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑