森林竞争算法及在超越方程求解中的应用

针对现有的仿生优化算法局部搜索能力差、早熟收敛问题，利用自然树枝条的生长、凋落矛盾统一原理和森林生态系统中竞争排斥原理，建立了森林动态演化的竞争模型，提出了森林竞争优化算法。为验证算法的合理性和有效性，将其应用于超越方程的求解。与标准遗传算法进行对比，该算法运行速度快；与标准粒子群算法进行对比，该算法搜索到全部解的成功率高。该算法为优化设计和计算提供了一种新的方法和思路。

A Forest Competition Algorithm and Its Applicationin in Solving Transcendental Equations

In view of such drawbacks of current bionics optimization algorithms as poor local search ability and premature convergence , a competition model of forest dynamical evolution was established by using two principles . One was the contradictory unity of growth and whiting based on natural trees, and another was the competitive exclusion in forest ecosystem . Furthermore , a forest competition algorithm was proposed. To verify the algorithm , we applied it to solve transcendental equations . Compared with the Standard Genetic Algorithm , it ran faster . Compared with the Standard Particle Swarm Optimization , it had higher success rate in searching all solutions. This algorithm may provide a novel method for design and calculation of optimization.