Description: 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.
File list (Check if you may need any files):
郭涛算法1.cpp
Download