制作站群，对搜索引擎优化的初学者而言站群是非常复杂的。
The station that make group, to search index props up optimized abecedarian and Yan Zhanqun is very complex.
该算法能克服基本微粒群优化算法精度较低，易发散的缺点，有较高的搜索效率。
This algorithm can solve the problem of low precision and divergence of basic particle swarm optimization algorithm, so it has higher efficiency of search.
该算法通过将整个搜索空间分割成若干子空间，在这些子空间上利用嵌入零搜索算子的微粒群算法进行优化。
The algorithm divides the whole search space into a number of sub-spaces, which are optimized by utilizing the PSO embedded zero search operators.
应用推荐