郭涛算法(GuoA)是基于子空间搜索(多父体重组)和群体爬山法相结合的演化算法。它通过利用少数个体所张成的子空间随机生成新的个体,体现了随机搜索的非凸性。此外,由于GuoA算法采用了单个体劣汰策略,算法在每次演化

迭代中,只把群体中适应性能最差的个体淘汰出局,淘汰压力

较小,既保证了群体的多样性,又可使具有较好适应性的个体能够一直保留。实践证明, GuoA算法具有较好的坚韧性,对于不同的优化问题无须修改算法的参数,而且效率很高,可能同时找到多个最优解。-Guo Tao algorithm (GuoA) is based on the sub-space search (more than the reorganization of the parent body) and combination groups climbing the evolutionary algorithm. It is through the use of a small number of individual sub-space by Zhang generate a new random individual, reflects the random search of the non-convexity. In addition, the algorithm uses a single GuoA poor individual survival strategies, the evolution algorithm in each iteration, only to groups of individuals to adapt to the worst performance out of the game, out less stressful, not only to ensure the diversity of the groups, but also could have better adaptability to the individual has been retained. Practice has proved that, GuoA algorithm has good tenacity, and for different optimization algorithm is no need to change the parameters, and efficient, you may find more than one optimal solution at the same time.