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.

郭涛算法1.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．