论文部分内容阅读
提出一种适合于复杂函数寻优的多群体遗传算法。该方法对搜索区域进行划分，使每个子区域具有简单的函数形态，而对每个子区域安排一个子群体进行搜索。这个过程可并行进行。仿真表明该方法速度快，可同时获得多个局部极值点。
A multi-group genetic algorithm suitable for searching complex functions is proposed. The method divides the search area so that each sub-area has a simple function form, and arranges a sub-group for each sub-area to search. This process can be done in parallel. Simulation shows that the method is fast and can obtain multiple local extreme points simultaneously.