Region Encoding Helps Evolutionary Computation Evolve Faster: A New Solution Encoding Scheme in Particle Swarm for Large-Scale Optimization
提出一种区域编码方案，将解表示从单点扩展为区域，并应用于社会学习粒子群优化，通过自适应区域搜索策略在保持多样性的同时加速收敛，在CEC 2010和2013测试集上表现更优。
In the last decade, many evolutionary computation (EC) algorithms with diversity enhancement have been proposed to solve large-scale optimization problems in big data era. Among them, the social learning particle swarm optimization (SLPSO) has shown good performance. However, as SLPSO uses different guidance information for different particles to maintain the diversity, it often results in slow convergence speed. Therefore, this article proposes a new region encoding scheme (RES) to extend the solution representation from a single point to a region, which can help EC algorithms evolve faster. The RES is generic for EC algorithms and is applied to SLPSO. Based on RES, a novel adaptive region search (ARS) is designed to on the one hand keep the diversity of SLPSO and on the other hand accelerate the convergence speed, forming the SLPSO with ARS (SLPSO-ARS). In SLPSO-ARS, each particle is encoded as a region so that some of the best (e.g., the top P) particles can carry out region search to search for better solutions near their current positions. The ARS strategy offers the particle a greater chance to discover the nearby optimal solutions and helps to accelerate the convergence speed of the whole population. Moreover, the region radius is adaptively controlled based on the search information. Comprehensive experiments on all the problems in both IEEE Congress on Evolutionary Computation 2010 (CEC 2010) and 2013 (CEC 2013) competitions are conducted to validate the effectiveness and efficiency of SLPSO-ARS and to investigate its important parameters and components. The experimental results show that SLPSO-ARS can achieve generally better performance than the compared algorithms.